CT38917

The Lesser Followers at Rye Hollow

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

It is audit day at the gristmill of Rye Hollow. Blythe spreads the vials records across the table and picks up a sharp pencil. 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 <= 3064; -1000000 <= a[i],x <= 1000000.

Example 1:

Input: 383 461310 993716 -546162 149515 950658 962587 -48657 125036 876331 788192 439651 -929054 -9524 240636 -329654 -939515 499190 977740 642011 -990843 974139 -756655 -33849 -303726 -360544 -345141 697307 -182002 78381 -271598 856278 476349 381327 -793222 -88785 10578 131035 -28284 204858 601647 -722549 -263748 -546918 -960352 -137385 850880 -509959 -612417 -387635 -586135 506134 265713 933385 15217 684184 782432 -683017 -161020 508030 -47705 972134 358072 -907373 153088 -880577 -550256 490375 877801 252144 275084 -279457 223740 597315 -696620 -706503 -519472 773389 362356 365745 -72456 -400102 -286728 651350 -164677 -533123 -385641 238662 795857 -483257 682374 649666 142535 -783609 -152485 -454770 -704764 54532 -858569 450190 -272087 -257288 -854087 -631300 343693 236816 417338 -272147 -10898…
Output: 280 381 78 214 367 369 171 208 351 340 271 11 182 229 117 9 276 362 303 1 359 39 167 116 109 111 306 137 192 121 329 264 246 29 152 176 192 162 202 279 42 120 71 3 138 314 79 58 97 62 250 207 319 166 278 299 50 128 247 148 319 220 12 180 18 63 239 297 197 198 104 187 252 46 43 69 278 209 210 137 86 99 251 118 64 87 183 272 72 248 245 164 29 114 75 42 151 18 208 95 96 18 47 184 170 197 92 113 148 222 137 226 133 74 31 221 196 108 112 110 7 259 156 256 139 228 199 186 164 175 89 74 43 59 201 187 92 203 11 92 211 51 159 80 127 25 98 226 214 190 64 1 198 180 77 49 2 64 81 5 117 165 100 31 99 17 109 110 142 141 69 194 105 8 7 175 130 12 175 152 87 136 140 172 36 124 124 180 137 33 60 31 16 183 99 160 179 8 25 70 176 145 137 118 120 47 66 122 131 126 71 74 8 150 19 25 151 59 90 65 138 82 79 24 7…

Example 2:

Input: 51 582078 466021 236104 -172139 30736 418165 -177576 554423 862743 408509 898738 568556 -352342 -624255 392354 104058 338420 62043 -141632 480622 -64405 158646 771813 179313 -445569 -549711 147444 -781016 217290 844752 18206 470766 -411048 -758883 834771 229585 -301137 -261688 747728 -949876 -979713 383064 -286191 271596 -142032 -287274 535265 515402 -159299 -444691 656974
Output: 43 36 29 15 20 32 14 35 41 30 40 34 9 4 27 18 24 17 14 24 14 16 26 16 5 4 13 2 12 21 11 14 4 2 16 9 3 5 12 1 0 6 2 4 3 1 3 2 1 0 0

Example 3:

Input: 2463 106689 177400 -949818 265846 30583 -878675 -993837 420214 825704 800059 986857 89521 604276 -574788 25637 -619860 384745 -564901 -226752 -803994 7976 929706 653847 -406198 164104 -247880 937174 -821815 -612533 998280 -48607 131575 887133 226152 -864366 -647412 -829560 -535295 328721 826368 111927 217944 -934479 -42119 -483828 -529198 629734 -260601 -240947 118959 233260 -245716 -965248 555839 -621973 495720 -807001 659797 511564 673464 643560 -217318 -228101 -744133 -636 392442 -725550 428278 -190648 -223755 -303734 -322373 -255721 -971079 -436320 990659 38718 954271 125547 516579 690896 -617480 673687 -90010 -286836 -935120 -346193 783031 -829095 -972355 -474722 -581235 -248422 702018 935581 662061 114467 580445 480828 616541 -622718 261487 -165411 369448 -48558 -159724 44012 -365316…
Output: 1419 1502 67 1608 1324 142 11 1799 2239 2200 2432 1395 1991 536 1314 476 1752 548 1009 233 1292 2343 2027 760 1471 976 2352 217 491 2432 1211 1431 2288 1540 161 435 202 582 1669 2214 1405 1528 88 1213 644 592 1983 944 975 1405 1538 970 38 1908 467 1837 224 2001 1853 2012 1990 1008 989 290 1258 1728 317 1770 1034 990 879 849 943 28 700 2373 1293 2326 1392 1844 2014 469 1993 1142 899 85 817 2111 199 25 644 510 946 2017 2284 1973 1375 1899 1792 1931 458 1536 1054 1671 1175 1061 1285 784 172 1896 616 2209 1643 1901 310 857 581 734 2125 1993 325 2170 1056 2287 421 3 2081 1201 1450 1725 695 1724 482 310 2116 1443 434 1935 2172 1850 2119 829 1203 1269 1628 1262 1571 1148 51 171 1570 1424 1295 1048 504 1987 1262 2283 1492 1298 66 1927 1445 966 1022 208 188 1799 1573 1743 1517 417 607 1612 1393 161…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Lesser Followers at Rye Hollow - MEDIUM Coding Problem | CodeTikki