CT46431

Notary's shelves Reckoning

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the tulip beds of Bloomhaven, someone must recover the missing manifest. This year the task falls to Notary, armed only with the shelves register. 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 <= 1642; -1000000 <= a[i],x <= 1000000.

Example 1:

Input: 520 -919799 814642 578760 224749 -742781 -505422 -798085 812542 331138 -456170 60512 523119 -869788 123992 50355 -359033 -976166 348398 -8881 -988 -244145 543261 -203009 416285 744737 -526063 970092 47851 321650 179472 387604 710662 915951 -66477 317470 -553833 -344185 696506 91457 604994 -504314 858644 -452575 -820627 -563891 788157 613395 373969 -577936 -411885 -135363 370408 129459 756857 706580 614048 50307 82335 -612671 -797659 -803418 297264 -524194 -446146 732871 215475 462036 796523 820600 204870 -479982 -778369 372307 -410758 -422185 -984334 98666 -176598 59099 -233361 -160069 -789653 898382 -191103 -318416 724597 -883623 165959 -982137 165567 -399496 820561 140731 368069 854265 392893 -362003 697113 -350859 853597 -927535 848045 504435 -888129 -660615 395254 -164652 -913854 65014…
Output: 17 475 408 317 69 128 55 468 342 142 272 386 36 281 268 168 6 338 248 250 193 382 201 351 437 118 483 258 328 287 340 421 465 234 325 114 166 410 265 383 123 449 139 49 107 431 380 328 104 139 208 323 263 415 402 374 249 256 96 52 51 302 112 133 401 278 328 410 413 273 120 54 310 132 131 3 246 190 239 174 190 50 414 184 157 381 24 250 3 248 129 391 242 291 396 296 141 363 144 391 13 387 312 19 75 291 178 14 339 307 77 309 262 289 25 173 90 171 177 373 49 327 40 326 287 72 192 121 173 166 346 125 38 64 64 262 330 81 324 84 266 248 330 270 237 335 336 6 59 34 317 296 53 256 116 28 120 302 45 89 278 85 178 92 154 237 243 321 102 129 328 63 248 229 125 27 58 327 121 1 213 122 54 200 93 74 249 115 232 176 171 93 183 107 197 247 250 221 213 250 287 314 189 126 203 41 47 105 101 172 289 118 91 30…

Example 2:

Input: 1243 -769505 226897 852598 -726150 679502 -294083 -331970 -315490 -187273 689682 957056 802545 -975064 -998301 70097 831304 -224969 386748 810924 -54506 990945 -606341 -152517 -532922 416662 -45956 -472473 876666 -684311 967317 884717 -647303 -743564 740427 -745486 -185932 -20863 66022 815318 -921540 245880 -126204 964522 -624082 237236 800867 -647218 -751022 -218184 949491 896035 -993099 220216 709727 588264 -592717 621830 -704045 959424 -28150 -876784 -466159 851062 -194998 965857 -312991 348330 749485 191848 -491851 -172699 -296797 961997 395612 603654 809052 -332606 201500 -856945 -667388 6995 -400473 -336264 -861985 -21276 -190647 -461342 -489422 -634900 -872148 -355044 -350512 -44922 757839 -688204 -440463 941796 -78160 -894065 -561823 63204 -989182 -290087 836662 -395371 -409829 350…
Output: 132 752 1148 160 1036 419 389 398 489 1039 1199 1110 14 1 651 1127 461 849 1112 569 1214 239 509 278 863 571 302 1137 181 1194 1138 209 147 1053 145 480 582 633 1099 44 742 514 1180 223 734 1084 206 139 454 1162 1123 4 714 1021 946 235 969 160 1160 566 74 291 1096 466 1159 380 791 1031 690 279 475 393 1149 818 943 1065 368 691 81 187 580 328 362 76 558 458 289 277 208 75 347 349 536 1019 166 297 1110 513 63 243 593 4 383 1052 319 307 762 1040 629 793 283 646 462 821 161 840 843 720 928 347 80 308 802 834 732 1054 278 760 779 341 850 658 959 477 114 296 869 270 505 677 71 490 798 606 913 582 449 45 366 482 135 1082 168 1035 61 762 886 91 1000 671 424 1065 308 212 1049 478 265 766 114 199 661 506 941 1037 139 738 841 824 407 281 1007 275 822 239 1052 913 493 425 643 712 147 459 971 561 501 5…

Example 3:

Input: 570 204179 285910 -753894 -145476 4136 88065 541610 -488450 132335 -236255 648525 488287 456794 -505428 817059 987381 529702 332229 -690996 -730208 762664 -168714 100766 381776 858237 476135 -898837 -424433 -358171 145995 417448 -113138 -790114 -372962 -75393 -90789 558054 -205800 -132010 272548 -570946 602342 611482 -204292 681225 -254776 -920722 -613370 699348 29459 -269159 -723949 -95904 -515325 616006 552116 -567048 -443121 413059 -366614 -355022 -855375 -813258 989211 780763 3293 -689314 559494 20139 -693582 459447 872109 -573394 -616198 -458331 -81724 782520 229435 -721943 -891103 -987630 193008 143516 200938 26494 706472 254889 -477985 973880 -931584 581470 365595 483401 -542411 436587 -418564 468135 -268496 882899 -41471 806454 588800 -415975 -703711 988554 260026 193019 -487248 -5…
Output: 339 360 73 253 293 305 429 149 311 229 467 413 397 144 512 551 417 361 89 78 488 241 299 368 512 402 38 167 192 308 376 251 59 183 265 257 412 226 242 332 119 423 426 225 445 215 26 109 445 277 208 76 243 135 419 394 117 153 353 178 182 48 53 505 450 261 82 390 262 81 357 473 111 103 142 240 441 296 74 41 2 284 273 286 255 415 296 132 477 20 377 319 352 112 336 147 342 188 449 238 429 370 148 73 464 289 274 126 110 129 47 417 428 435 13 92 207 136 226 388 226 129 405 407 372 23 117 102 383 57 8 225 214 383 344 105 51 340 351 119 384 203 1 380 111 333 171 352 82 200 19 109 84 370 131 158 205 339 205 312 203 16 31 229 58 303 270 337 73 286 334 49 306 348 139 313 6 324 113 340 28 40 167 339 160 81 32 49 50 209 157 237 144 69 45 315 288 125 239 336 139 68 101 164 113 130 188 139 239 51 140 318…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Notary's shelves Reckoning - MEDIUM Coding Problem | CodeTikki