CT37201

The Highreach Lesser Followers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

It is audit day at the mountain city of Highreach. Gail spreads the shelves 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 <= 3060; -1000000 <= a[i],x <= 1000000.

Example 1:

Input: 1027 349315 328420 -403023 -69254 -822947 202252 -705336 618629 -719687 -835980 -315060 -296384 768956 -783157 -529434 -231323 -2742 708092 860734 339170 -436976 -194759 860684 426305 -48209 -26507 -932385 -693716 494788 -980837 744477 798974 -422238 519348 -917099 -417395 325702 -943883 -394088 -356319 573591 775395 -274978 636441 -938264 -660015 619943 -209626 827438 -63197 -414757 -585570 -37688 -549755 549338 -193415 -197518 892805 708919 -302687 -734676 -219659 350074 -230375 -440677 557190 -968706 834384 516670 -239896 -815691 501334 245748 754676 66296 -981100 590944 -317265 39802 -216182 160527 944823 -444698 805045 825165 939001 456999 949734 -17114 832843 -52955 -462419 -452368 -346417 694835 241411 -247881 946367 -272154 -765095 509333 -407296 917000 759908 440090 -708849 882063…
Output: 680 666 296 456 89 599 152 826 147 81 336 344 903 108 226 376 486 861 940 655 269 399 936 699 456 465 28 158 729 3 872 898 277 744 34 279 642 19 285 303 778 879 344 805 21 167 798 378 894 434 276 198 444 211 750 386 380 918 828 323 131 364 637 359 258 750 7 881 719 351 87 706 577 839 487 2 758 311 474 361 523 917 252 853 860 910 672 914 439 862 423 239 246 296 794 563 340 903 329 110 695 267 890 822 654 136 867 832 284 574 745 506 87 68 54 324 626 270 437 125 199 298 50 235 538 641 498 617 457 57 217 149 242 560 61 122 147 311 527 760 529 631 641 739 817 417 616 142 584 92 117 313 354 14 41 381 857 111 122 688 416 303 232 434 583 549 661 597 346 484 375 10 58 666 669 558 322 370 651 651 747 68 53 609 261 756 654 134 108 402 509 560 317 578 214 498 797 479 323 257 483 62 38 575 654 193 607 …

Example 2:

Input: 209 654586 944661 -726988 -835911 506266 -741699 774522 -92391 -885939 -513771 -739199 611438 292393 863346 -494726 612790 -171205 921398 988706 614129 -320771 368678 555552 -491683 -720622 -500474 731115 179394 -381407 479951 -26221 797055 -962353 871426 578624 799483 -831770 -919494 773437 -795069 -591456 -918087 408171 -184285 160 -369990 648608 831936 -140267 -18559 -895966 621386 879248 -931205 765430 -900062 -176610 -463585 679461 -84301 -430883 386797 -378386 -421967 -600989 441890 -377463 -928913 707598 -971781 854871 748492 -771884 -271118 519443 691954 542466 39972 -286926 -319119 -335885 -835552 261930 -539821 -300100 -915894 271247 347284 517961 -666807 -863691 12098 258985 863050 -204799 193453 -819940 67741 24269 909244 -206634 -406309 759291 291168 -344087 -914831 -906851 52…
Output: 175 206 39 27 152 36 181 96 22 52 35 160 132 186 52 159 86 190 190 158 69 132 148 52 35 50 158 115 57 135 94 163 5 169 142 161 27 11 155 28 38 11 123 73 90 53 139 153 74 86 17 135 152 8 141 15 69 42 131 74 43 108 46 43 33 109 44 8 123 3 132 123 22 51 107 118 109 77 50 46 45 18 88 34 44 8 86 89 95 26 14 64 81 110 47 76 17 65 62 107 45 34 96 75 37 8 9 80 49 98 16 22 63 80 13 54 26 11 51 10 54 21 62 13 77 74 14 24 67 31 35 47 48 60 0 28 46 24 20 13 56 59 63 55 55 32 53 20 39 32 56 24 17 53 43 50 32 13 19 3 8 26 36 23 29 37 3 40 31 0 23 16 27 32 33 5 28 23 23 15 26 17 11 8 13 19 0 19 2 7 1 2 9 15 2 2 0 11 2 3 0 4 0 4 2 0 1 1 0

Example 3:

Input: 2168 -548141 897164 242030 855483 -5587 14507 768201 -955911 241116 483632 -711703 -581663 348505 630126 -371937 -152333 757650 327568 -510835 394041 404653 732919 380082 -542115 804103 838527 9316 992960 888700 -587658 -480139 438810 53943 157785 664399 -787218 -146614 186264 475658 286110 -324234 15699 596366 -815945 649058 531834 -688724 507691 -529691 -383780 -195645 -871075 -97234 494041 -433954 -754581 -534529 484043 -632869 -379590 -812981 698787 170827 156250 846169 -714113 -373673 644349 533201 434436 117631 -131873 -950856 -979030 617791 -186934 -316013 -734774 -51359 551823 -110796 -699131 -646584 181037 532490 7900 -644863 -278037 807041 -210549 246641 -882748 559880 115719 711201 -94806 -613544 450438 527336 -244702 761838 723058 -358191 -803456 -365993 -539723 -531073 -646844…
Output: 469 2081 1358 2028 1076 1102 1932 49 1352 1639 299 433 1464 1791 646 901 1913 1445 503 1511 1520 1879 1497 470 1955 1988 1091 2131 2041 428 525 1553 1133 1241 1810 219 899 1275 1607 1388 692 1090 1727 186 1789 1655 328 1630 484 622 839 134 949 1615 572 248 475 1605 381 624 190 1810 1243 1221 1960 292 626 1765 1639 1523 1181 897 52 27 1727 839 685 271 988 1655 918 304 358 1239 1623 1060 360 718 1897 800 1310 120 1651 1162 1793 933 389 1532 1609 763 1840 1798 633 198 625 455 466 355 989 745 817 1347 1357 1253 165 181 1511 778 117 539 682 579 1989 681 1002 1312 1539 309 1980 1147 1735 103 793 1395 1454 1688 1018 1074 635 1715 1913 589 504 1974 1140 1905 2017 1761 942 1355 610 514 250 613 1073 1649 1279 479 724 1817 327 534 1292 770 1331 1778 1654 1373 1537 432 1210 1690 144 651 927 919 1012 1…

Constraints:

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

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