CT52476

The Crystal Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

At the cork grove of Barkhaven, Quade records each signals in a worn leather ledger. The guild wants answers, not guesses. Task: For each day i, print how many consecutive days up to and including i have a price <= a[i]. Input format: First line: n. Second line: n integers. Output format: Print n spans space-separated. Constraints: 1 <= n <= 4000; 0 <= a[i] <= 10^9.

Example 1:

Input: 3495 89901680 572450108 491316385 612833932 290675003 35138216 26161460 398287032 750393998 565918368 773114826 955719658 607372437 898596239 344745824 595268079 879532942 245296382 355965864 77997682 902429475 81806874 723339195 218635703 271315733 184701250 236927727 456577649 776664115 150968037 907088928 382368941 295444568 357016393 555523740 419807826 770199323 86930711 537617370 321565601 213330581 758081943 170620593 244605169 115957624 522736950 687001086 945985425 721539368 972759627 878294708 293395847 120624556 116342913 990777373 434224933 518503552 673825396 124920541 598643995 819085942 975113572 725014320 399123160 859247785 708765498 944184574 898338473 350359753 401201210 694441880 719333193 999873846 950844241 334929663 902977700 758372867 439452747 170852079 136264883 6…
Output: 1 2 1 4 1 1 1 4 9 1 11 12 1 2 1 2 3 1 2 1 9 1 2 1 2 1 2 5 8 1 19 1 1 2 4 1 6 1 2 1 1 5 1 2 1 4 5 36 1 50 1 1 1 1 55 1 2 3 1 2 6 7 1 1 3 1 5 1 1 2 3 4 73 1 1 2 1 1 1 1 4 6 1 2 1 1 1 3 5 16 1 2 3 1 1 6 1 2 3 4 1 1 2 1 1 1 1 5 1 1 3 16 1 2 25 1 1 3 4 47 1 1 2 3 4 1 6 1 2 1 10 1 2 1 1 3 1 5 8 1 1 22 70 1 1 2 1 2 5 7 1 9 1 1 12 1 1 2 4 1 6 1 8 1 22 23 1 1 1 4 5 1 2 1 2 10 1 2 106 1 2 1 1 2 4 1 2 1 1 9 1 2 1 1 14 1 1 2 4 21 1 1 2 1 4 5 1 1 8 1 11 1 2 1 4 1 1 39 1 2 1 4 1 1 1 2 4 1 2 8 1 1 3 1 17 1 2 3 1 1 3 1 1 9 1 2 1 1 2 4 1 1 1 2 5 1 2 1 2 1 11 1 2 1 1 1 4 1 1 2 8 1 2 1 4 1 2 60 1 2 1 2 1 6 1 2 3 4 5 1 2 1 15 1 1 3 1 5 1 1 2 9 1 1 2 1 2 1 6 1 18 1 1 1 1 1 4 7 1 9 28 1 1 2 4 5 1 50 1 2 1 2 1 2 3 1 5 8 1 2 1 2 3 4 7 1 1 1 3 4 1 2 1 4 1 11 1 1 1 4 1 2 1 86 87 1 2 1 2 1 6 7 1 1 2 98 1 2 1 2 3 1 5…

Example 2:

Input: 3374 40532038 114497594 444226883 909898935 312880784 274557127 493055746 145294579 130452089 180581569 68950266 915035798 131153425 919317764 610258479 718492800 851117128 18134143 289634976 128646498 313057542 115680631 341931160 31582649 181056199 88454482 444461423 705003814 389376452 640113716 512623231 857965256 189450932 622502089 198948624 412339811 652424456 9413694 722532442 876270310 37813881 440684127 918220239 442104612 737556930 932187644 440885459 637292949 706832304 223238089 344583104 614856185 849901489 282445373 253471299 621199150 192783883 387005353 738722619 675736310 690068420 749490381 6718907 195835948 840124798 964455966 842962108 332068537 340777822 8849682 381702135 733638124 982864959 152402184 638222896 911244610 92696941 462549224 14638089 827085600 718352941…
Output: 1 2 3 4 1 1 3 1 1 3 1 12 1 14 1 2 3 1 2 1 4 1 6 1 2 1 10 11 1 2 1 18 1 2 1 2 5 1 7 26 1 2 29 1 2 46 1 2 3 1 2 3 7 1 1 3 1 2 6 1 2 9 1 2 12 66 1 1 2 1 4 5 73 1 2 3 1 2 1 4 1 1 1 1 2 10 1 2 1 2 1 1 2 1 1 6 1 10 11 1 2 29 1 1 2 4 1 6 1 1 3 4 1 2 3 1 1 3 7 1 19 1 2 1 2 1 4 1 1 2 4 1 2 7 1 2 3 15 16 1 2 1 1 5 1 2 8 1 2 1 4 1 2 15 1 2 1 2 1 37 1 2 1 1 2 6 1 2 9 1 2 70 1 2 1 103 1 1 2 107 108 1 1 2 1 4 6 1 1 9 1 2 1 2 3 4 1 2 3 4 5 1 1 12 1 1 15 1 2 1 2 20 1 1 2 1 217 218 1 1 3 1 2 1 1 3 1 2 1 1 13 1 1 1 1 4 1 1 8 1 10 1 12 244 1 1 3 1 2 1 4 1 2 3 1 9 1 1 3 1 1 3 1 2 3 1 5 1 25 1 2 1 1 5 1 2 1 2 1 6 1 1 2 1 4 1 2 7 1 1 1 11 13 1 1 3 17 1 2 1 1 5 1 2 3 4 1 2 3 8 1 1 1 1 5 1 1 49 1 2 3 4 1 1 3 1 5 1 11 1 2 1 2 5 1 2 1 2 95 1 1 3 4 1 2 1 2 1 4 7 1 2 1 2 1 6 1 1 20 1 2 1 1 3 4 5 1 1 2 1 1 5 34 1 1 2 …

Example 3:

Input: 3387 516963228 451941515 275379756 244956442 467364577 790569398 492731989 42271616 266053803 928729970 738196269 47636083 683588805 107669540 397454203 689403524 38454882 400523090 558047441 612937054 977494188 112446285 699959166 441004979 318149405 822881264 492147426 392533596 11791935 512499126 580681079 69707863 982646734 143843925 240331827 208314985 874438423 332567697 428380944 968983727 478438145 420445606 934745221 295416485 161524461 245359445 789331144 379398166 649907251 193260299 641522612 408368340 842833475 169804759 490622689 2709490 973540360 888106109 467862090 903788811 357647808 895291932 812283406 853252149 365274538 500563557 547564201 176079886 707644528 202820471 185137232 557022819 169561266 793126830 614787252 874349876 181390904 122820739 772846526 678950986 22…
Output: 1 1 1 1 4 6 1 1 2 10 1 1 2 1 2 5 1 2 3 4 21 1 2 1 1 5 1 1 1 4 5 1 33 1 2 1 4 1 2 7 1 1 3 1 1 2 4 1 2 1 2 1 10 1 2 1 24 1 1 3 1 2 1 2 1 2 3 1 5 1 1 3 1 10 1 14 1 1 3 1 1 6 1 2 1 2 1 2 7 1 2 3 17 1 1 1 40 1 1 3 1 2 6 1 2 1 1 5 1 1 1 3 4 6 1 1 2 1 5 1 88 1 2 1 2 1 127 1 1 1 3 1 1 3 4 5 1 7 1 1 2 1 1 1 7 8 1 1 3 23 1 2 1 2 1 4 7 1 1 10 1 1 1 1 3 4 7 41 1 1 1 3 1 5 7 1 2 1 4 1 2 14 1 1 1 4 1 1 21 1 2 1 2 3 6 7 1 1 2 4 1 75 1 2 1 2 3 1 1 1 4 1 6 1 13 1 1 2 1 4 1 6 1 1 1 3 1 5 1 2 1 4 1 1 3 1 15 1 2 1 2 27 1 1 2 4 1 2 1 2 1 10 1 1 1 1 2 3 1 5 1 2 1 2 1 6 1 14 1 1 2 1 19 22 1 2 1 2 1 2 5 1 1 3 4 1 2 3 1 2 39 1 2 42 1 1 1 46 47 1 1 1 4 1 2 1 4 1 6 11 1 1 14 1 2 1 18 1 1 3 1 1 3 25 1 1 1 2 5 1 1 2 1 4 1 1 2 3 1 41 1 1 3 1 1 2 3 1 2 1 2 3 1 14 113 1 1 3 1 1 1 2 5 1 2 1 9 1 2 3 1 1 2 4 1 9 22 1 2 3 4 …

Constraints:

1 <= n <= 4000; 0 <= a[i] <= 10^9.

Loading...
Test Cases:No test cases
No test cases available.
The Crystal Streak Back - MEDIUM Coding Problem | CodeTikki