CT39557

The Scarlet Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the lily shoals of Padmore; Aldo weighs the day's marks manifests and starts the calculations. 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: 1436 399652211 63545135 59895102 13213071 456012294 584767571 332389525 860641685 44504297 355934379 164815791 456430615 908056589 927742832 50740012 720264233 728111113 115887344 850865573 401687533 577858899 360558432 485928508 301946167 811434300 893029151 792982883 829592002 188360455 993745174 557526558 143160947 251358308 383415200 568481201 803834535 416815739 937488868 912087112 220817024 640872546 557414132 474652325 857285401 674301107 699168604 990108354 963124963 767812284 91217472 113821115 83354891 787830595 37662956 759015564 483658546 932272801 973027674 31428724 206668824 948446453 373480562 483229000 949972717 59143933 796956233 304265492 373144380 64866222 825936714 378022559 382025059 363411153 311082846 745966090 491122776 744536388 36851829 929239171 158137137 2073366…
Output: 1 1 1 1 5 6 1 8 1 2 1 4 13 14 1 2 3 1 5 1 2 1 2 1 6 12 1 2 1 30 1 1 2 3 5 6 1 8 1 1 2 1 1 5 1 2 17 1 1 1 2 1 5 1 2 1 9 11 1 2 3 1 2 6 1 2 1 2 1 6 1 2 1 1 5 1 2 1 15 1 2 3 4 1 2 1 8 1 89 1 1 3 4 1 2 1 1 2 3 7 8 1 1 3 1 1 2 1 2 3 7 1 2 1 4 1 1 1 3 4 1 2 8 1 32 37 1 2 3 1 5 1 7 1 2 1 1 3 6 1 1 2 3 5 1 2 1 1 1 4 1 1 1 4 1 1 2 14 1 1 2 3 1 2 7 1 1 2 1 2 6 33 1 2 1 1 2 1 1 54 1 1 2 1 1 1 7 1 1 2 1 5 1 2 3 1 71 1 1 2 4 1 2 7 1 1 1 3 4 1 7 8 1 1 89 1 1 1 3 1 1 2 4 8 1 1 1 4 1 2 3 16 1 2 1 2 1 2 3 1 26 1 2 3 1 1 2 7 8 1 2 1 1 2 1 4 1 1 2 19 1 1 3 1 5 1 1 2 3 1 1 2 3 5 6 1 1 3 1 2 6 156 1 1 1 3 1 1 6 1 1 1 2 1 1 1 2 1 1 18 19 1 1 3 1 5 25 1 2 3 1 5 31 1 1 1 4 5 37 194 195 1 2 3 1 1 1 3 4 1 1 1 4 1 14 1 2 3 4 1 2 1 1 2 1 2 3 7 1 1 16 1 2 1 1 3 1 5 6 1 1 2 12 13 44 1 2 1 2 5 1 1 1 2 4 11 1 1 1 3 1 1 2…

Example 2:

Input: 217 34543684 6589655 868561398 329131638 901035979 899788379 449021140 78692939 321643768 589318733 176103661 528251299 445553575 627110191 72205264 501588244 148693245 441915658 150351771 764256747 724106865 940765587 496524860 935864250 418734424 965561431 232479995 31376295 384603976 354916450 973592237 145797190 492071042 381991591 190695082 723146699 456502310 855550803 536635812 866713331 974575998 50494393 185135762 826633188 824784321 748243158 487965518 760495674 978143734 549820928 481488736 120085777 80731806 435578782 835179988 482795324 562452075 890258028 659864011 334844167 480102464 678917127 232636755 635334913 478990232 303151722 76499490 251401150 381662114 552511872 882353829 359407641 358786014 89132223 436662057 870619843 741241505 941472333 537045815 513834807 218091…
Output: 1 1 3 1 5 1 1 1 2 4 1 2 1 8 1 2 1 2 1 14 1 22 1 2 1 26 1 1 3 1 31 1 2 1 1 5 1 7 1 9 41 1 2 3 1 1 1 3 49 1 1 1 1 3 6 1 2 9 1 1 2 4 1 2 1 1 1 2 4 6 13 1 1 1 4 5 1 29 1 1 1 4 5 1 2 1 2 1 4 1 2 1 2 1 2 5 1 13 1 2 1 2 1 6 1 21 1 1 1 1 2 4 7 1 1 10 1 12 1 37 1 1 45 1 1 2 1 2 1 2 1 8 1 1 11 1 88 1 2 1 2 3 1 1 1 97 1 1 1 3 1 6 1 2 3 1 11 1 1 3 1 5 1 164 1 1 2 3 1 1 6 1 9 10 11 1 1 14 1 2 1 4 19 1 2 1 1 5 1 1 2 1 4 5 1 8 1 2 1 4 1 6 1 2 1 4 5 1 2 14 1 16 17 1 1 3 1

Example 3:

Input: 2683 629004387 936667092 250416940 577296321 47866170 544274762 507463911 983643358 409812564 477895011 773288192 188106914 484858961 529835368 845421855 247529252 708197235 411734410 470096203 375280028 260530690 735396992 542062224 637221020 722457071 969037578 153568522 757144239 198560772 689247758 608427567 822184351 802986841 615663704 591104291 97794711 106111708 86978031 878056142 437886365 51757680 614373243 650904448 889796773 639657510 231910883 247381463 168870598 857185970 727336923 339583481 162253761 232879090 694692621 434999458 43572520 257857521 37290001 728784058 556644768 322450891 793548646 142899104 268837039 257080995 200510291 821676310 378409486 465588341 955170521 441051761 287160705 972292735 537273793 549178657 889588951 268501792 540014259 377975539 948642734 1…
Output: 1 2 1 2 1 2 1 8 1 2 3 1 2 3 7 1 2 1 2 1 1 7 1 2 3 18 1 2 1 2 1 6 1 1 1 1 2 1 13 1 1 3 4 18 1 1 2 1 5 1 1 1 2 4 1 1 2 1 10 1 1 13 1 2 1 1 18 1 2 44 1 1 65 1 2 3 1 2 1 7 1 2 1 4 1 2 1 4 5 1 2 1 20 86 1 1 2 4 5 1 2 3 4 10 1 98 1 2 1 1 5 6 1 8 1 1 11 12 1 1 2 1 1 1 1 8 1 2 1 24 1 2 1 1 2 3 4 6 1 1 3 1 1 2 7 1 1 10 1 2 1 152 1 1 1 2 3 1 6 1 1 10 11 1 2 1 1 5 1 2 8 1 2 1 1 5 1 7 1 9 1 2 1 2 5 1 24 1 2 1 2 5 1 1 1 3 1 11 36 1 2 1 1 1 3 1 2 1 1 5 1 1 3 4 1 14 15 55 1 2 3 1 1 3 1 5 9 1 2 3 1 1 70 1 1 1 3 1 2 1 7 1 10 1 1 2 3 1 6 1 2 3 1 11 1 2 14 25 1 1 3 1 2 1 1 3 1 1 6 1 2 39 1 2 1 2 5 1 1 3 4 5 6 1 8 1 2 1 137 1 2 1 1 5 1 1 3 1 2 1 2 1 4 1 1 3 1 1 12 1 1 3 4 1 1 7 1 2 1 2 32 1 2 1 2 1 6 1 1 1 3 4 1 2 7 1 1 3 11 1 2 1 2 3 1 1 2 20 1 2 1 1 2 1 1 3 1 2 1 12 1 2 35 75 1 2 1 1 3 1 5 1 2 10 86 1 2 3 1…

Constraints:

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

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