CT49546

The Beryl crates of Harper

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the caldera rim of Firewatch as Harper unrolls the day's manifest of crates. The tally will decide the next shipment. 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 <= 3307; -1000000 <= a[i],x <= 1000000.

Example 1:

Input: 292 41684 -992535 819216 315224 1904 602995 -969727 -941941 697575 -1441 128105 864102 -428151 -441137 -111538 736305 138885 -796916 254385 479431 789750 96410 966323 182193 -204944 -835217 87375 -769772 250642 463341 -233405 103571 -481744 486610 -565172 -54882 -61898 -519645 -438751 -862737 -924411 25524 822575 185546 227179 976436 713133 184198 16648 750602 728201 -464504 705838 695649 910074 -981181 -935417 -362056 962935 71856 -456336 -603688 -20173 -567148 158371 347996 -154195 239506 -496968 578492 89892 -707906 -612635 84430 -506573 -305190 522312 -869202 103020 -595893 -913333 290104 174901 508861 -675157 -314485 659600 569886 -821039 -908289 -547795 -288075 -266175 -191475 -543515 -124379 -362846 -255131 39047 835576 -575403 -571701 634022 -374730 867633 -570374 120069 -439888 -3…
Output: 157 1 262 195 147 229 3 5 237 144 167 262 82 78 125 236 165 25 179 203 240 158 266 168 113 20 153 26 172 193 106 154 66 192 53 128 126 60 73 16 8 131 226 154 155 246 208 153 129 208 206 66 204 202 225 1 5 78 231 132 66 39 119 47 141 152 101 144 57 177 131 25 37 127 54 78 165 12 125 36 8 136 129 156 27 72 169 160 16 10 41 73 76 83 41 88 62 75 104 175 35 36 151 57 174 36 106 49 63 85 58 160 93 43 73 167 70 62 137 91 29 130 15 43 125 7 117 100 72 8 107 55 3 100 51 114 139 36 116 102 82 97 85 36 97 57 3 79 79 87 98 108 106 6 88 20 109 94 49 70 45 23 110 80 16 5 72 93 47 116 52 41 105 59 88 66 110 32 111 25 67 5 98 19 3 87 24 90 78 5 82 68 12 78 39 81 42 84 37 42 10 1 76 33 54 86 1 80 11 24 33 27 3 13 71 65 29 58 50 51 32 26 37 36 19 8 54 1 26 2 39 4 45 13 42 10 17 43 13 36 46 32 0 14 46 26 6 2…

Example 2:

Input: 2904 -974405 -970862 196119 522364 994932 669854 -643002 -436785 955817 -125146 -486760 -645121 579981 -477897 323710 -190561 266828 -512395 896932 800531 295760 400031 919767 114838 -201024 -762846 -926762 -65673 932 -801062 -322310 707024 -79671 95026 808360 567113 86924 277381 -532740 -207384 777640 749103 -179733 -24338 432888 682158 622318 -675958 124793 -433920 -405382 -825208 -781429 274852 -782555 454748 -846036 -564202 -191153 -511764 861449 998780 -373194 -6391 321983 753434 -704058 -664623 456152 -76418 510098 473185 946076 -114831 938487 96644 17612 -733808 382267 -448643 -128670 425934 -646616 207612 -239004 451802 557502 -46061 -145685 588735 831125 462348 459361 -226848 309940 -70983 945380 -675584 -157435 963703 -426694 -111107 -903345 -249427 112117 -618253 -327527 -8005 7…
Output: 35 41 1722 2192 2893 2411 510 804 2845 1263 736 504 2274 749 1899 1166 1822 700 2727 2597 1863 2007 2766 1605 1150 335 89 1331 1431 279 978 2436 1311 1566 2591 2239 1558 1825 659 1135 2537 2486 1175 1388 2044 2397 2308 450 1599 798 834 253 303 1809 301 2062 222 609 1148 690 2638 2840 880 1405 1858 2475 409 461 2055 1298 2127 2077 2771 1249 2758 1547 1441 369 1949 774 1230 2008 488 1692 1074 2036 2179 1340 1202 2224 2570 2047 2045 1088 1835 1295 2747 445 1187 2771 793 1245 131 1060 1552 533 947 1381 2434 1038 2029 1876 561 2506 197 2466 2447 2679 911 2019 2428 1550 806 48 253 1186 149 2059 1691 1867 9 90 2227 679 515 2244 1992 538 23 824 1139 583 2448 1973 1088 2640 2108 1676 471 1524 507 764 455 2157 2540 2165 794 2395 1384 1228 2669 894 2452 899 1219 628 476 1000 1582 1314 1083 1795 745 2…

Example 3:

Input: 2209 -894425 499237 899509 99162 -556254 820246 -722020 24739 -712840 -511725 -655605 637386 -348800 -680975 813568 -310519 -381809 354116 -480066 -739153 -801670 -670691 -545845 934475 -249266 -549317 305684 142788 -544332 -300963 16961 976491 -642772 263679 350952 -204738 -520287 487783 711767 371283 -616893 -287264 628519 -766686 -96572 920804 -233571 23558 156762 -205178 -695310 -208561 -908177 -583584 484047 -214176 -634665 354449 490665 478810 -455534 -607921 126797 -957334 -900973 862980 -258755 452546 -471779 868361 -763304 -347321 -279407 -782774 -731785 -531889 247284 337248 -115461 -146510 -298926 829130 145238 986664 -540824 66900 -280834 221203 430929 514872 456238 679944 758356 177583 317908 917170 -663264 -397166 645012 -171551 394790 352942 -469828 -727702 184467 -457600 -6…
Output: 114 1646 2096 1206 493 2005 318 1126 328 534 391 1787 727 359 1985 766 695 1480 575 299 216 369 490 2103 824 487 1407 1239 490 766 1096 2143 401 1365 1460 865 516 1609 1839 1483 428 774 1750 263 976 2072 830 1098 1239 858 335 854 99 459 1591 842 404 1449 1593 1584 583 432 1201 53 104 1996 798 1544 566 1995 263 705 768 237 301 491 1316 1412 933 898 750 1946 1206 2105 482 1120 762 1277 1505 1587 1528 1759 1842 1235 1377 2021 374 647 1720 861 1464 1419 560 305 1239 567 429 1420 1477 1119 1473 1761 1702 1020 1004 1378 1392 417 74 1304 2081 1341 1298 686 1912 517 488 1247 1258 1631 1819 1343 777 1649 652 165 2006 1654 325 914 2012 2061 906 1799 645 440 1547 597 51 1330 1377 132 520 1568 1562 734 523 1628 1146 1430 822 1827 1368 1773 1385 1986 1269 1003 1939 1570 154 559 1383 1876 1637 992 119 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Beryl crates of Harper - MEDIUM Coding Problem | CodeTikki