CT53588

The Deepwater Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the fjord village of Deepwater as Tomas unrolls the day's manifest of ledgers. The tally will decide the next shipment. 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: 3285 422952673 758777072 10406978 728779013 736903771 275541780 711812137 269739140 302296346 48530535 842102165 812231026 357677619 943214451 958522359 218464488 130557309 93776036 462662845 569551261 799348359 198439971 480325608 282085506 743201772 72202630 33084204 819692499 132266641 924957823 263879949 212694034 39185609 615463656 947409337 649060711 129731447 379661569 765577178 579743861 948580618 452530887 732333140 699289559 981253687 273256213 676006748 766343909 897195265 540598010 731969003 51250396 916431991 770806340 894383606 986885935 802897572 528011307 725240168 353632951 403257939 400590169 409802847 192908033 967965226 128372349 168089136 325730037 802403633 215939602 654031836 479993826 649146703 402306278 157762632 265148764 656209953 224388010 889008124 554580509 37…
Output: 1 2 1 2 3 1 2 1 2 1 11 1 1 14 15 1 1 1 4 5 6 1 2 1 4 1 1 13 1 15 1 1 1 4 20 1 1 2 4 1 26 1 2 1 45 1 2 3 4 1 2 1 8 1 2 56 1 1 2 1 2 1 4 1 9 1 2 3 4 1 2 1 2 1 1 2 8 1 14 1 1 1 1 2 5 1 8 1 10 1 2 1 4 1 1 1 1 4 1 2 12 1 1 3 4 1 2 7 1 1 2 3 5 1 1 3 4 1 1 3 4 5 10 45 1 1 3 4 5 1 2 1 2 1 6 1 1 1 15 1 2 3 1 65 145 1 2 1 2 3 1 1 1 1 10 1 2 1 1 3 1 2 6 1 1 2 1 13 24 1 1 3 1 2 3 1 2 9 1 2 1 1 2 1 1 2 6 10 1 1 1 2 3 4 1 7 1 9 1 22 1 2 1 1 2 6 7 1 2 1 4 5 1 2 1 2 1 2 1 6 1 2 45 1 1 3 4 1 2 1 2 1 1 2 1 9 1 1 16 1 2 1 4 1 6 23 1 1 2 4 1 6 1 2 1 4 79 1 2 1 2 93 1 1 3 4 5 1 1 1 9 1 2 1 1 2 3 5 1 2 3 9 1 1 14 1 1 1 27 1 2 1 2 1 2 34 1 2 37 1 2 1 1 3 1 5 8 9 1 1 1 2 14 1 16 54 1 1 2 4 59 1 1 2 4 1 6 66 1 2 1 2 3 6 1 1 9 1 11 1 1 3 4 1 2 1 1 1 6 1 1 2 14 15 93 1 2 1 4 1 99 1 2 364 1 1 1 3 4 1 6 1 9 1 1 1 2 1 …

Example 2:

Input: 109 787933747 792094881 384417353 411781484 492595168 927600638 14155471 749357068 359296669 869796063 275026247 906980158 411632725 11640320 165033225 108662594 258544604 973067867 584120124 964899509 811309090 589231683 543101788 263693903 126943972 720348818 530802808 217312918 199612055 115069736 310241154 602235461 962226905 491421974 628230141 531104153 244707592 100181701 725486396 120545071 938334111 551742884 86601709 617423896 613971022 216007049 109781235 345590708 472384785 234690272 427732601 988544272 627324787 432247144 943971648 51077616 724245732 251757966 771259631 267942297 498024206 684165215 584456717 762118130 964989801 199245634 779471158 203856306 992646774 145390467 533043357 889974977 142245051 971565586 860359380 596753459 621892522 6325761 628636660 734701415 41…
Output: 1 2 1 2 3 6 1 2 1 4 1 6 1 1 2 1 4 18 1 2 1 1 1 1 1 5 1 1 1 1 4 6 13 1 2 1 1 1 6 1 8 1 1 3 1 1 1 3 4 1 2 52 1 1 3 1 2 1 4 1 2 3 1 5 13 1 2 1 69 1 2 3 1 5 1 1 2 1 4 5 1 2 1 4 1 2 1 19 1 2 22 1 2 3 1 1 6 1 1 3 1 1 12 1 2 3 107 1 1

Example 3:

Input: 98 883402836 15545966 122625554 901632985 880369998 245484633 814573589 507723691 813431282 571724429 459198415 767706204 503878916 998809694 996473452 98230442 347990651 294849943 328380902 398071774 294579814 85789321 868679481 599644749 635234339 388461470 1326103 419592396 785902970 765103853 545976394 915230723 356268479 384706035 288303358 435634587 665397625 542491646 680498686 951891566 493766546 134556610 709371095 728022081 912436805 540625532 224178495 883829887 972660427 985990495 482818735 281794701 527632498 939161311 964190659 356220728 282274464 195635261 254356106 962067101 500221411 2217480 982488991 585795834 940310252 197121782 434383626 252816839 492408251 392412870 826586890 626032481 902125231 93575071 694918480 719694083 162783175 3938465 926735245 312331471 4966967…
Output: 1 1 2 4 1 1 2 1 2 1 1 3 1 14 1 1 2 1 2 5 1 1 8 1 2 1 1 3 6 1 1 17 1 2 1 4 5 1 7 25 1 1 3 4 5 1 1 3 34 35 1 1 3 4 5 1 1 1 2 5 1 1 13 1 2 1 2 1 4 1 6 1 8 1 2 3 1 1 14 1 2 19 1 2 3 1 1 1 2 5 1 7 1 2 3 1 82 1

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.