CT44588

The Ashen Lesser Followers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Viktor found an old ledger of registers in the mill attic at the cork grove of Barkhaven. The margin notes pose a precise question. 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 <= 2143; -1000000 <= a[i],x <= 1000000.

Example 1:

Input: 1502 -342191 26396 923074 423595 377365 -467434 829184 620200 -29309 -135291 646891 193200 952100 761222 446314 -988544 167659 -173727 847974 -839396 -609570 -953374 866045 -565330 -332524 -621241 -771345 249682 490321 -789613 -787649 -998309 -260510 974738 -96551 509143 -169383 659929 -919558 -129394 -164063 -135991 772740 381638 616745 896221 887679 -118389 -44079 973834 705270 -415500 -431937 -628865 303145 300820 787881 -514029 80312 143804 -343998 -249768 289998 667182 -393815 423405 208520 174572 -369398 28828 17594 -783932 -60588 -53349 -821705 -981482 317323 497044 963272 -810381 494660 219756 -479174 150486 -769170 -955169 -215934 -158351 -340107 535643 915167 392665 488669 -172844 -942257 705005 444566 -79966 418153 -620082 174163 217568 776456 -647427 -311419 -966945 -92800 -863…
Output: 482 770 1423 1046 1008 412 1340 1187 718 633 1212 880 1445 1291 1057 11 865 595 1346 146 313 45 1358 335 482 300 194 907 1080 183 185 1 519 1446 651 1090 588 1199 73 620 588 613 1273 987 1154 1369 1360 627 690 1426 1227 430 417 286 928 927 1273 372 781 830 464 521 917 1184 437 1004 861 843 447 743 729 183 672 673 150 16 920 1049 1392 158 1045 859 388 817 186 41 535 577 456 1066 1336 960 1031 566 52 1185 994 643 974 288 821 844 1223 268 468 32 627 117 6 784 1139 580 537 3 226 825 1374 228 985 282 259 125 333 95 10 1023 1035 1250 1233 41 530 1231 1358 79 925 772 1295 1329 301 865 1145 142 1231 838 935 843 0 299 891 480 410 1027 626 912 706 1177 1238 416 985 1028 1234 1068 1272 315 727 5 1182 305 226 277 1312 397 1296 23 958 801 481 355 20 1056 332 1161 604 832 301 762 464 428 483 526 84 920 …

Example 2:

Input: 336 -64699 381745 -733231 -931222 926310 -774585 751132 -823518 414137 740459 -78342 295964 545262 67507 -258972 925808 -38170 417640 -853666 331031 -976078 791739 746786 475854 72291 -949731 -981003 -621434 449286 488907 664475 248136 -34146 -966533 -16485 637881 -323446 -224976 -342130 -921999 878294 521716 321687 -107756 -856301 -210087 -22280 -753129 -653164 166585 34210 -49565 357130 -117104 699195 736365 -7869 -939654 -612889 -437325 575811 -322867 990983 364505 562886 -588952 21423 -197732 765968 -692419 -58154 -833601 -222305 -533921 194211 -71696 -809018 272675 -26492 655086 459535 -60530 -741283 815747 -222372 267993 503457 969816 -804247 8885 -344062 655202 -589662 373836 960239 663840 164225 459796 -714664 -602293 -252238 -943029 -284178 -456424 -498245 447146 754602 694844 609…
Output: 149 222 50 13 320 43 284 34 219 280 143 207 235 172 110 309 148 214 26 207 5 277 270 219 168 9 4 53 209 215 246 188 143 6 145 233 96 111 94 12 274 211 193 128 20 112 137 37 48 162 145 131 185 122 231 238 135 8 48 74 203 88 272 179 197 50 135 106 230 43 122 24 101 57 148 116 27 158 119 197 172 116 35 222 97 152 172 242 28 118 79 188 44 158 235 189 135 162 35 42 83 7 78 62 57 152 193 184 170 110 121 61 3 50 58 196 63 29 100 50 4 161 96 89 161 186 115 206 82 23 40 104 95 129 91 139 178 78 162 84 181 24 189 16 187 37 101 94 48 110 79 138 182 8 170 93 137 147 97 23 11 81 100 88 113 147 54 0 130 34 12 73 79 61 160 3 64 41 17 109 88 90 99 89 147 27 141 145 65 17 48 134 51 46 83 96 99 94 123 77 48 7 85 124 106 102 128 50 52 25 84 99 42 36 51 63 102 48 42 71 22 75 61 6 78 85 107 99 37 52 85 3 0 1 2…

Example 3:

Input: 27 -607088 961920 635635 885274 54152 -385144 -607334 40591 -704277 811237 -120439 -919275 984096 -490335 833682 750552 95872 171796 913545 -60864 6836 -490694 -938025 -447813 -182945 664554 310711
Output: 4 24 17 21 13 7 3 10 2 14 6 1 14 2 11 10 6 6 8 4 4 1 0 0 0 1 0

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.