CT39002

The Streak Back Beneath Mirrormere

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Draper runs the ropewalk at the lakeside town of Mirrormere. Today the books show a list of beacons, and the numbers must be worked out before sundown. 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: 2785 948502888 726223141 738245088 195779951 755797074 361330328 451809765 376600902 474623009 550033295 276887429 494534448 115652120 356136478 375946864 613962894 95165069 440133916 943425487 312121285 854592059 667090498 639685752 219812394 645195881 282337470 719658419 417665493 418647376 136730807 60921209 849410640 458994416 215749028 607466194 54866240 613231289 815934183 283790242 648752988 661785059 358052112 14511003 836191506 875445007 590630700 108142740 962551613 930746410 754192164 573539075 756119960 235964210 434171626 672498902 120861379 25467607 987334000 171368955 483346496 667434666 835543902 911798430 641617647 608629657 62924793 238115836 864824057 649848016 990715084 398348409 218366079 80718181 54524449 221248785 492094730 37108449 616975250 297444052 226646568 3085…
Output: 1 1 2 1 4 1 2 1 4 5 1 2 1 2 3 11 1 2 18 1 2 1 1 1 3 1 6 1 2 1 1 11 1 1 3 1 5 6 1 2 3 1 1 12 26 1 1 48 1 1 1 3 1 2 3 1 1 58 1 2 3 4 5 1 1 1 2 5 1 70 1 1 1 1 4 6 1 8 1 1 3 4 1 14 15 16 1 2 1 2 1 6 1 2 1 1 1 28 1 1 3 1 1 3 1 36 1 2 1 4 1 1 2 8 1 1 3 12 1 2 1 2 3 1 5 8 9 1 2 3 1 5 1 2 3 1 5 1 1 22 1 1 3 1 1 3 1 5 6 10 1 1 1 4 15 1 2 1 2 1 4 5 1 1 3 4 1 2 3 4 1 1 1 17 1 19 1 2 3 1 1 1 4 1 28 1 2 1 4 1 1 7 53 1 2 1 1 1 6 1 2 1 1 204 1 2 3 1 1 1 1 3 1 10 1 1 2 14 1 1 1 1 5 1 2 3 1 1 3 1 13 14 1 1 1 32 1 1 2 3 1 2 1 4 5 1 10 12 13 1 2 3 1 5 1 1 3 1 10 11 1 13 1 1 2 1 4 1 7 1 22 1 1 2 1 5 6 1 2 1 1 1 1 3 14 1 1 1 2 1 5 6 1 9 1 1 1 1 3 6 1 8 1 1 3 1 1 2 3 8 1 10 11 12 1 1 32 1 2 3 72 1 1 3 1 2 1 2 5 330 1 1 1 2 1 5 1 2 3 10 11 1 1 1 4 1 1 18 1 1 3 1 1 2 1 5 1 2 11 1 1 1 2 1 5 1 2 9 1 40 1 1 1 2 1 2 …

Example 2:

Input: 2981 513213780 488232661 678145813 938583222 579429682 939458459 565987644 748152380 570185602 211129650 98001882 399214901 579901006 317633187 626385278 285212545 993184459 847080774 942018607 948887519 664012907 941471691 83278861 881316833 414897552 945810678 977505035 686844853 628710782 465517320 524601796 969483876 881626645 738090411 276971927 833582245 337346345 474421675 68454913 676391798 293163947 355541248 506646810 91629058 64262159 155786549 631015502 369461220 502688309 674663139 965604462 332299808 189123901 864399920 826075641 930231655 502449116 495670044 256088879 867192965 930301655 580403842 629807469 575575963 846843826 754363452 816923593 82067751 453351643 713366914 965503372 17640465 444226492 994154757 182415072 280736285 887385589 764101713 77684297 897264930 321…
Output: 1 1 3 4 1 6 1 2 1 1 1 3 5 1 7 1 17 1 2 3 1 2 1 2 1 6 10 1 1 1 2 5 1 1 1 3 1 2 1 4 1 2 3 1 1 3 7 1 2 10 19 1 1 3 1 5 1 1 1 4 10 1 2 1 4 1 2 1 2 3 20 1 2 74 1 2 3 1 1 6 1 1 9 10 1 1 2 4 1 6 1 2 1 4 21 1 2 1 2 100 1 1 1 3 1 2 1 2 1 9 10 11 13 1 2 16 1 2 1 2 1 1 7 1 2 3 1 1 6 7 1 9 1 1 2 1 5 1 2 1 2 3 1 2 1 2 1 9 1 2 1 2 1 1 2 3 1 6 27 1 2 1 1 2 65 1 1 1 3 1 1 1 1 3 6 10 1 2 3 1 1 6 1 8 1 2 1 1 2 6 7 1 1 3 1 20 1 1 2 1 1 1 7 1 2 1 2 42 1 2 3 1 1 6 1 2 1 2 5 1 1 2 3 5 1 1 1 4 1 1 1 4 9 1 1 2 4 1 6 7 22 23 1 25 1 2 1 34 35 1 2 44 1 88 1 2 3 1 1 6 1 2 1 4 11 1 1 1 2 16 1 1 3 1 5 1 2 1 1 1 6 1 1 3 10 1 1 18 19 1 37 1 1 3 1 1 1 2 1 9 1 2 3 1 5 1 1 2 18 1 2 3 22 1 1 2 3 1 5 6 1 1 2 11 1 2 3 1 5 6 1 1 2 1 5 1 1 338 1 1 2 4 1 1 7 1 2 1 2 3 13 1 2 1 4 1 6 1 1 1 3 1 1 2 3 1 5 1 2 9 13 1 15 1 1 1 20 21 1…

Example 3:

Input: 2117 193827182 234131884 720711866 740290461 784498753 597650540 814471436 305449480 789428134 942921919 399203855 679907825 382260517 941666197 617887282 359389920 850650692 984948661 132426620 411376321 590691988 983595292 254153365 629880987 854575896 16911267 547468056 16575856 355146821 339510855 359659772 374312956 574396661 53984092 888136140 627694844 974301805 718009399 61138983 392980591 320135616 160311213 264024376 945185459 716991251 321116324 878268619 973745421 706646095 966326954 508344021 316274314 475462135 986006557 561544337 394995143 139861748 59201674 658766636 638799834 535391527 309236620 482590982 991811273 739052883 802043239 136381527 756452988 92277858 717465512 110068112 370727898 324330707 270723891 454709064 327824521 408154771 441398431 164128574 376816139 7…
Output: 1 2 3 4 5 1 7 1 2 10 1 2 1 4 1 1 3 18 1 2 3 4 1 2 3 1 2 1 2 1 4 5 8 1 13 1 15 1 1 2 1 1 2 7 1 1 3 11 1 2 1 1 2 54 1 1 1 1 5 1 1 1 2 64 1 2 1 2 1 2 1 2 1 1 5 1 2 3 1 2 15 18 1 1 21 1 2 1 4 1 2 1 2 1 4 5 1 1 1 2 10 38 1 1 2 1 1 3 1 8 1 2 1 1 2 3 1 1 3 7 1 9 1 1 3 1 15 1 65 1 1 1 4 1 2 7 1 1 1 2 5 1 14 1 2 3 1 2 1 1 3 1 2 6 9 1 1 3 4 1 15 1 2 3 4 1 21 1 2 170 1 1 2 1 2 1 1 2 1 2 8 1 10 1 1 13 1 2 1 1 5 1 2 1 1 1 6 1 2 1 1 1 2 1 19 36 1 2 1 1 1 3 7 1 2 1 2 1 1 1 3 4 1 6 1 8 10 1 1 2 4 1 1 2 1 5 1 2 12 1 2 1 2 38 1 1 2 1 43 1 1 1 4 5 1 2 1 1 2 1 5 1 1 10 1 2 1 1 5 1 2 1 1 1 6 7 1 1 2 3 4 6 1 1 2 1 2 1 2 14 1 2 1 2 3 1 91 1 1 3 1 2 1 1 1 2 5 1 1 2 11 1 2 3 4 1 2 1 19 1 2 1 4 27 1 2 3 31 1 2 1 35 1 2 1 2 3 1 2 1 1 2 1 4 1 1 1 11 1 2 1 1 1 2 7 1 1 3 1 5 27 1 2 3 4 5 1 1 2 3 1 11 1 2 43 1 2 208 1 2…

Constraints:

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

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