CT54620

Last ledgers of Harper

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the kelp forests of Tangledeep as Harper unrolls the day's manifest of ledgers. The tally will decide the next shipment. Task: For each position i, print how many elements to its right are strictly smaller than a[i]. Input format: First line: n. Second line: n integers. Output format: Print n counts space-separated. Constraints: 1 <= n <= 3475; -1000000 <= a[i],x <= 1000000.

Example 1:

Input: 1258 584490 985476 593469 53259 962743 -18197 173555 -526125 -383091 -504648 -429544 -497040 -793059 216421 -552119 -544435 -963079 -432842 -666604 552303 215707 -398781 722687 804090 191300 294872 457662 -907762 917512 -124500 679503 -325185 678613 -986247 -553763 84000 792827 -536933 114143 149425 267088 -562659 960907 -288262 216065 -9862 -880997 -188028 471319 154590 -338139 -225407 644215 -316776 873138 491024 -853493 429418 885411 -284303 746420 875191 -150218 -704670 -294330 -297412 -917342 635892 41237 -417458 -470994 -240378 -111874 -974665 492587 -533336 -367025 797504 -671754 -202024 314884 809886 885782 -427885 -496971 -682076 -882973 299909 894600 413238 326456 609559 981526 856083 413154 -273510 -83097 -845031 68981 826426 -487095 534530 420936 802243 232064 939021 -310893 20…
Output: 981 1248 985 657 1229 612 729 283 379 298 349 306 133 746 263 269 26 343 203 951 739 363 1047 1107 722 779 886 58 1175 525 1018 402 1016 8 258 659 1090 270 675 695 755 250 1190 416 726 596 69 475 877 694 392 454 980 399 1119 879 93 846 1121 413 1037 1115 493 173 407 406 51 963 614 347 310 437 513 19 867 265 366 1055 193 455 749 1059 1099 331 289 183 66 740 1099 806 755 929 1154 1077 804 403 527 93 614 1057 293 880 804 1038 697 1119 387 684 161 866 340 158 447 729 134 272 845 869 884 116 478 780 933 734 391 55 901 733 251 123 789 785 751 216 1042 107 650 129 26 718 221 358 643 899 282 891 1111 1014 450 791 1087 68 346 511 498 668 396 980 923 678 254 275 117 263 431 341 254 476 393 337 212 813 908 65 175 39 362 965 750 794 1035 189 672 902 966 420 691 542 1009 663 232 467 649 908 99 486 438 …

Example 2:

Input: 2139 933101 947474 696364 223623 -479351 848080 -697933 806317 -544665 -4385 -327074 -504791 -948935 578717 -541075 564655 970434 -458271 875679 -580078 -150757 761473 -407850 37051 -652398 669315 890778 -322124 74710 -225987 190540 818891 887308 246931 334797 -363317 -915774 -637230 364496 -810360 906608 660576 667671 746204 319666 789611 241355 -805871 203298 -191188 -126539 -106490 -400055 -849855 -644689 -85993 940034 -993855 -738405 718851 810896 907330 6145 17379 82317 -627861 301092 -435787 435223 580450 -45880 728982 -610046 848113 835060 -263476 -766414 -245928 -496803 127903 921758 -991768 -705348 397331 270353 512395 244385 875938 -718157 -922174 -270307 -566317 -149709 -408253 -962882 -221912 -681131 888978 979604 782060 -43595 -767602 212003 991589 517392 721122 476075 735493 …
Output: 2055 2076 1789 1328 543 1946 328 1898 472 1061 697 513 63 1666 477 1654 2083 557 1966 432 905 1838 608 1094 362 1753 1980 694 1134 816 1277 1894 1971 1338 1431 653 91 375 1455 190 1988 1727 1737 1809 1408 1851 1325 195 1286 859 923 941 612 153 364 958 2010 9 265 1766 1859 1970 1049 1060 1128 374 1366 563 1505 1628 990 1766 389 1886 1871 755 235 778 507 1165 1961 13 313 1454 1330 1554 1302 1904 292 84 738 431 880 588 45 796 330 1911 2016 1800 978 230 1259 2022 1545 1737 1514 1748 1492 1508 705 663 1676 896 1170 633 275 996 466 628 1733 126 158 803 1385 1047 386 1636 1056 146 1192 867 1791 1013 1723 240 201 1029 1850 1512 983 1920 876 1084 1863 1736 765 896 119 76 1488 248 665 1150 151 431 761 1723 60 496 770 1750 11 1871 18 48 797 1242 1738 1955 399 450 1367 1909 905 194 1469 1782 1454 1197…

Example 3:

Input: 497 467661 -162899 -174680 -133475 789213 984436 -596762 -704487 543517 968040 -926744 -122259 81620 -571581 -134879 -189486 905878 -657804 -233080 701027 265260 -834300 -253041 -456905 -106176 -805549 226684 301749 -95735 908701 -668727 73190 -458782 677244 261367 -357329 847348 -570228 871161 -409304 -406854 -995928 698819 451630 -314090 -483132 244062 45162 823754 -640618 -643806 726051 -28852 177147 -39853 552558 -918646 -288382 172200 969474 545686 867261 -791255 788705 362647 -302210 -316053 -148287 -783214 -783691 -411699 -752239 -462918 -958916 793682 -821258 615241 -835726 -747641 -815828 -798646 70602 -781458 550539 -190242 983632 802087 -100770 324110 -372163 -784067 596105 -262286 896397 -428679 -214789 -905431 -637842 722593 54895 -768837 876287 -862901 365462 380940 76593 936…
Output: 364 214 213 225 432 487 103 74 369 479 17 224 268 104 220 206 457 84 191 403 306 34 184 133 220 41 288 305 222 445 79 252 130 385 294 153 417 100 419 138 138 1 383 329 158 123 280 236 400 85 84 381 223 261 218 337 17 159 257 430 330 397 43 382 295 155 152 194 46 45 129 52 118 8 372 34 339 30 52 33 35 221 40 314 170 407 363 189 267 126 39 323 147 383 116 161 19 70 340 208 41 363 24 267 271 209 374 255 26 218 373 124 231 12 366 22 4 119 132 25 63 60 289 164 153 160 144 286 319 88 40 302 305 139 308 177 219 18 357 227 348 99 128 329 164 147 157 322 278 33 251 245 229 286 119 215 265 30 280 265 32 280 147 77 317 15 290 205 312 76 246 207 113 72 189 143 274 256 292 131 230 228 286 292 68 73 190 222 276 109 105 175 40 159 298 171 64 113 172 260 168 279 231 269 280 173 258 181 134 174 24 241 183 …

Constraints:

1 <= n <= 3475; -1000000 <= a[i],x <= 1000000.

Loading...
Test Cases:No test cases
No test cases available.
Last ledgers of Harper - MEDIUM Coding Problem | CodeTikki