CT53819

Vermilion crates Lesser Followers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the salmon ladder of Rushing Falls opens only for a perfect tally of crates. Ulric means to find out. 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 <= 3663; -1000000 <= a[i],x <= 1000000.

Example 1:

Input: 1299 637771 466509 -258539 894306 79939 -176128 19934 856573 -32677 -217228 -510254 891014 -805890 -622016 -838261 -991276 -90388 996649 366662 -472009 -283726 730683 -249795 -498390 -416111 -828115 -670792 -224319 462632 -858306 867896 331173 838648 107255 -756631 -757258 -806776 -113106 -267731 -709609 953300 -478857 -549779 196834 -708467 -255138 122927 -982580 -603533 -682078 -578788 254867 253347 838474 192081 139507 747224 -268421 -83613 614622 -952334 -889107 974767 -237744 564982 46275 -299676 779959 387293 -559428 -141160 323869 -693397 -92539 -893206 -57776 829641 -643060 995811 -607607 -126049 -341094 -605558 -414551 -454248 207178 455707 941676 663399 966436 94427 -282507 558556 -152230 396380 107669 402358 -112433 69204 -849786 35762 -177290 -142013 79009 -190462 327590 -20386…
Output: 1056 967 463 1229 696 523 660 1198 626 499 300 1219 127 225 103 6 573 1280 889 320 431 1094 463 300 357 111 193 479 943 91 1186 850 1156 695 145 144 122 543 439 167 1224 309 264 743 167 446 692 12 224 182 234 775 773 1136 732 699 1075 428 556 994 28 68 1226 450 962 635 407 1089 862 250 510 813 176 540 64 568 1110 195 1218 215 514 378 216 336 305 719 895 1174 995 1191 657 403 937 494 851 659 852 515 633 90 612 478 497 634 471 793 464 404 306 683 1134 93 993 468 712 420 396 920 731 1114 740 1059 405 939 825 1129 80 279 446 926 958 785 946 552 189 117 842 835 45 1104 970 269 74 370 463 832 628 571 95 644 282 831 599 495 761 828 1022 373 322 1073 795 35 383 970 102 475 386 1010 600 60 902 866 1100 581 938 637 64 76 82 293 534 885 785 1013 731 653 158 399 913 646 158 651 375 571 1073 219 295 26…

Example 2:

Input: 2532 954877 923390 -202821 588344 -478922 -755485 416661 -394029 693660 -836718 923505 -751589 -478899 -460212 902249 -392945 513559 -728574 -694093 915428 -754537 491539 851503 315664 324742 -291917 995991 -774295 -193567 -40234 130521 -449432 -933112 -588616 -502616 887368 66885 829551 -806752 -904345 -126798 -138258 -887742 -108951 -154373 -913516 115106 68322 -326319 14658 714791 -338286 -879265 -823839 -457440 694290 135789 840434 814003 -804716 -213203 -93065 -579292 171560 404533 650410 260343 464092 -607594 -426014 -203781 -597270 -957587 -779721 -920347 661823 784213 305148 -335216 770751 -935648 -965379 -369019 -642685 258779 -620391 -673784 997772 -600016 152822 -629978 -74342 464092 -940728 925098 163103 62292 -80318 252856 -965324 184733 -943237 658854 -52272 750980 575102 953…
Output: 2461 2419 1009 2020 672 319 1802 760 2143 215 2411 329 669 690 2380 759 1911 351 398 2390 322 1880 2310 1657 1666 876 2499 284 1004 1211 1426 698 96 529 625 2348 1353 2273 248 133 1095 1078 154 1111 1057 119 1399 1345 816 1270 2130 801 159 226 681 2106 1413 2264 2231 246 963 1120 532 1449 1741 2048 1560 1821 495 709 974 509 53 271 107 2054 2174 1606 792 2157 90 37 757 441 1547 471 402 2441 497 1413 453 1120 1801 81 2330 1424 1310 1114 1529 37 1443 77 2029 1149 2110 1925 2355 881 924 621 629 1679 654 636 127 1461 159 1259 1262 1346 1107 1179 1349 538 1417 860 253 284 314 558 119 2106 1674 1099 1698 963 1723 2373 1605 2348 323 1986 456 573 1402 427 2026 1443 505 1163 1897 1816 1420 1071 335 1040 1514 989 324 928 2178 1683 1646 1536 1638 537 1038 2317 2009 1890 819 2331 1915 1584 1650 2313 11…

Example 3:

Input: 3223 718307 216238 356978 -541258 579691 -69920 701903 -836745 111533 -150506 656132 371233 -848735 223859 -659094 253860 -858308 -226491 989086 -878754 625791 442887 -771118 -766540 685573 5305 -659017 -106852 -502208 160535 172546 272247 89107 550655 -824419 272410 -888549 -836007 866947 363764 197673 462041 214725 235935 -918730 757969 513881 -852773 81786 50510 -787742 -857121 817058 -253776 159082 866238 -968571 847665 986868 788061 351613 926592 124420 242072 -542267 -198630 856747 120087 -25882 -962008 -280418 -944556 179926 -82632 549211 58689 466917 875501 258688 -560236 -201398 826248 -94102 -997057 866293 -837364 46454 712096 -107656 -80713 -754232 480380 682851 181434 -36624 -113952 -696361 365385 939652 -842235 -565825 -579640 6981 -23365 443974 -465462 293805 809855 -828475 9…
Output: 2739 1940 2149 715 2513 1511 2710 248 1779 1384 2633 2176 227 1945 535 1979 211 1247 3180 181 2578 2284 354 361 2665 1611 531 1441 776 1841 1859 2001 1734 2441 264 2000 166 245 2954 2133 1892 2302 1914 1942 126 2758 2370 218 1717 1679 320 209 2852 1193 1827 2933 43 2900 3137 2798 2099 3030 1770 1941 697 1281 2907 1765 1553 56 1143 82 1844 1465 2408 1680 2284 2928 1950 670 1270 2841 1440 3 2909 236 1655 2656 1421 1461 367 2289 2603 1836 1528 1411 454 2095 3026 227 658 636 1581 1539 2224 820 1983 2795 244 3083 2776 380 2256 249 285 1804 2844 1535 2310 3015 2687 1906 433 782 1228 1283 1239 108 1284 1608 493 1246 794 282 2718 1084 596 2171 2235 2350 2111 2459 2434 2276 1839 1201 855 1137 227 126 652 348 2755 2292 1312 1959 811 492 2691 792 2305 2660 1911 2767 1102 1846 1890 1940 1025 2523 2912…

Constraints:

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

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