CT61931

Last ledgers of Smith

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

It is audit day at the rookery of Crowhaven. Smith spreads the ledgers 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 <= 2576; 0 <= a[i],x <= 1000000.

Example 1:

Input: 2439 112443 862864 730588 725105 990175 366749 364630 978432 292471 470021 897019 274379 560864 930489 845456 785995 931260 398225 831846 541367 664621 235317 493875 193735 58444 438523 765279 658792 519035 481857 414142 968039 439293 581169 547819 821506 459503 532113 596417 146744 64977 467829 506428 798052 526549 987068 415654 868813 543862 100528 509168 258601 964649 67360 508937 86333 288313 523501 823844 107960 808903 667226 271222 151154 718596 775881 315641 762569 301629 102439 565123 34361 933175 539748 400885 225952 37076 362312 514596 214180 700264 949318 533854 243297 102773 862032 37629 944361 488967 913271 728895 572355 210583 176380 285123 122078 484960 551020 63870 341868 355316 249199 993826 887583 138520 430961 558538 944231 57738 931032 765615 950497 608009 75838 999545 …
Output: 255 2082 1747 1734 2406 852 848 2374 706 1079 2168 662 1338 2249 2030 1875 2248 918 1984 1282 1574 563 1145 456 124 1016 1808 1552 1213 1104 957 2326 1017 1377 1292 1945 1058 1249 1405 343 138 1066 1171 1876 1228 2358 957 2062 1273 212 1173 623 2298 146 1169 185 685 1212 1930 228 1898 1551 644 351 1672 1807 737 1770 714 213 1310 76 2200 1246 907 528 82 822 1169 488 1601 2235 1225 571 212 2005 84 2212 1102 2139 1677 1313 477 396 662 266 1084 1259 133 773 800 582 2317 2063 311 960 1268 2191 119 2163 1744 2212 1380 158 2322 430 1831 1411 2257 1204 714 198 1433 571 1789 2298 2211 1297 829 1617 2283 50 1673 1452 2053 1455 119 313 358 1456 237 168 74 988 792 25 1395 1439 812 1571 1993 2191 1714 2058 1226 1436 1559 1456 2178 1357 1047 6 1190 761 96 1446 135 125 2162 1674 2217 318 709 726 781 1400…

Example 2:

Input: 1111 825291 291181 453247 194684 369336 766392 323531 892732 195319 978925 667332 585658 570560 236610 293738 734215 546131 330067 773363 699338 178418 207532 657142 912893 679361 959022 682302 186009 606101 284382 233313 459242 638996 972528 446171 147731 413064 694506 793451 672736 38012 102784 766081 226753 623607 604385 329479 124643 844637 641666 246576 446895 701941 849997 183694 294210 799358 115164 863487 538818 232788 285905 956733 464123 106915 307605 366089 581556 341991 917860 261097 375284 661755 608951 440430 827647 240844 367539 890718 932038 509946 900916 638974 482914 725206 786592 611221 997474 822940 496559 906662 459545 563571 735882 813412 384842 117092 277405 342151 557465 41749 49604 998780 412626 188843 277681 700737 954305 802513 940407 241238 46526 77803 560285 51…
Output: 918 333 516 202 415 844 368 986 202 1079 743 664 646 265 332 805 610 367 842 769 181 216 726 992 744 1047 749 190 680 314 258 509 709 1049 493 146 457 752 850 730 35 97 814 245 691 669 357 118 900 701 268 485 745 901 183 320 843 106 908 580 250 308 1009 500 99 329 385 628 367 955 280 394 696 654 466 858 256 382 919 959 531 927 677 509 745 803 652 1019 845 515 923 485 594 750 829 401 106 293 364 583 40 49 1007 430 183 291 707 962 807 941 252 46 72 576 523 39 942 497 892 382 177 479 820 633 557 971 241 350 849 529 17 265 701 723 213 403 559 765 228 294 591 485 961 441 922 691 428 174 229 909 195 1 181 829 661 603 459 537 818 181 450 723 807 154 244 797 703 830 154 110 772 748 501 771 448 751 303 467 809 308 828 557 726 90 598 169 79 616 607 724 863 683 12 654 738 512 128 192 626 396 863 730 …

Example 3:

Input: 234 816477 118088 103168 42070 58945 877407 775317 2399 810801 573830 646464 148305 875312 362588 440 177811 691215 688137 329724 789512 474345 659284 779448 568294 117232 729363 23547 480632 898057 640816 307571 501485 364725 676807 168676 915483 900683 332538 124105 654779 453591 231446 410210 289802 153472 775966 725546 517861 355309 332135 842942 372684 561436 631870 466524 70893 700616 43215 181421 952947 498823 939724 918335 438043 648220 851872 707396 553775 92891 27669 562139 415491 68573 382352 698409 344248 508812 37116 740289 530403 308637 472179 948477 743799 768899 106114 966529 429725 539323 518361 565915 272471 411227 578985 598112 664900 823211 702243 590711 584395 399081 429015 527195 296690 902826 334476 437393 554493 997418 449106 246058 912842 869025 661459 778214 60936…
Output: 192 23 19 7 10 201 180 1 185 131 144 24 194 66 0 26 152 150 54 173 98 140 170 124 17 156 1 96 182 133 48 99 60 137 23 179 176 51 17 128 86 29 70 40 20 149 138 92 52 46 152 54 101 115 80 9 124 4 19 166 82 158 155 73 110 143 121 92 10 1 92 62 6 51 111 44 76 2 114 78 36 69 141 113 116 8 144 60 75 71 80 27 53 80 83 89 112 96 82 81 49 56 68 30 114 36 56 69 125 56 22 109 104 77 93 72 73 110 2 28 77 64 40 47 73 22 84 68 10 70 23 13 27 60 8 36 16 44 82 67 57 22 80 81 50 15 12 15 26 34 14 16 24 41 22 24 63 14 9 2 42 28 22 29 37 46 48 66 39 20 21 8 35 50 48 33 10 30 44 47 7 35 37 13 16 6 16 43 20 24 32 2 37 6 36 16 1 32 21 28 24 5 21 20 28 7 10 18 13 21 13 8 1 10 2 0 2 6 12 0 1 8 8 3 1 2 2 0 5 1 0 1 1 0

Constraints:

1 <= n <= 2576; 0 <= a[i],x <= 1000000.

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