CT42288

The Streak Back at Verdantstep

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the bamboo terraces of Verdantstep opens only for a perfect tally of signals. Harish means to find out. 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: 838 629925270 318457415 198947721 486600302 730089518 82599431 186570055 713492580 687365777 549885310 251226224 661329814 381586787 546020637 414617404 145193856 227095551 766897377 48008391 299227424 912431956 527173625 141231814 824592781 518748492 997333544 849255791 480588709 480390164 202514110 506833854 385541920 701522273 291414802 886724952 975123417 627929496 145483098 385055099 922684066 785030488 438856086 778077969 564706291 683661835 664759586 409392117 776402650 998683150 760202103 199443909 818323864 936329646 573437611 393156040 880759354 687766129 536389935 563343973 43240173 461017233 143137153 288894495 765988791 918662089 506530242 382785479 417424011 520160271 383354718 905882096 652506210 231001191 592022644 957494027 511330395 647389261 93333021 357317408 91074517 8…
Output: 1 1 1 3 5 1 2 3 1 1 1 3 1 2 1 1 2 18 1 2 21 1 1 3 1 26 1 1 1 1 4 1 6 1 9 10 1 1 2 4 1 1 2 1 2 1 1 5 49 1 1 3 4 1 1 3 1 1 2 1 2 1 2 8 12 1 1 2 4 1 6 1 1 2 26 1 2 1 2 1 6 1 2 3 1 2 6 1 2 9 42 1 1 1 4 1 6 1 2 9 1 2 1 1 2 3 16 1 1 2 4 1 6 1 8 1 1 1 3 1 5 1 2 3 1 1 12 1 22 1 2 1 1 3 6 1 2 1 10 1 1 1 2 5 16 1 2 1 4 1 2 61 1 2 3 1 1 3 1 5 6 1 1 2 1 11 1 1 14 15 1 20 1 1 1 1 177 1 1 2 3 5 1 2 1 1 2 1 5 1 2 1 4 1 18 1 20 1 2 1 2 3 6 1 1 9 1 2 1 2 3 6 1 1 2 10 1 1 1 3 5 1 7 1 2 1 11 1 1 3 1 1 1 7 1 1 2 41 1 63 1 1 1 2 3 6 1 2 3 4 1 2 3 4 1 1 1 8 9 20 1 1 1 1 1 3 4 5 6 1 2 1 96 1 2 1 1 2 4 1 1 1 2 1 1 2 12 1 1 1 3 1 2 7 20 1 1 1 4 5 6 1 2 1 2 1 1 33 1 2 1 37 1 1 2 1 1 3 1 47 1 1 146 1 1 1 4 1 2 1 2 1 1 2 3 13 1 1 1 3 4 1 1 21 1 1 1 4 1 2 1 4 1 1 2 1 2 1 7 1 13 1 2 3 1 1 2 7 8 1 1 1 2 1 4 32 1 1 3 4 1…

Example 2:

Input: 2307 775705043 626457384 710738813 726526488 869254848 561646994 583642060 577735613 86525798 287721009 269992738 422988151 364825107 650168334 83817329 995910309 852832177 352311089 801443098 786459960 657865614 986256408 299502015 965945291 995341677 996310265 534804102 831449279 292535320 657246178 270749727 190827797 668234180 530201043 991126766 598504476 375188983 283028008 131520399 348159484 623061767 149316659 138237189 72652103 723890716 92600197 463379682 514358296 633330067 234842387 631303586 546994023 472368179 111720389 411004665 332028338 648995024 414630297 746489538 46019142 836067956 344707598 805573575 80374767 806480654 653660001 486441282 170343630 298936273 791232174 545500074 486406600 296390084 947784810 772207305 840163699 466504578 819414701 86756075 925579804 62…
Output: 1 1 2 3 5 1 2 1 1 2 1 4 1 9 1 16 1 1 2 1 1 6 1 2 9 26 1 2 1 2 1 1 5 1 9 1 1 1 1 3 6 1 1 1 10 1 2 3 4 1 2 1 1 1 2 1 12 1 24 1 26 1 2 1 4 1 1 1 2 5 1 1 1 39 1 2 1 2 1 6 1 2 1 2 50 1 2 1 1 1 4 5 1 2 10 1 2 1 2 1 2 7 1 9 1 21 1 2 1 2 5 1 7 1 1 3 1 118 1 2 1 4 1 1 2 3 1 2 3 7 1 9 11 1 13 1 2 1 1 1 1 4 1 2 3 1 25 1 2 3 1 5 1 2 3 4 10 1 2 13 1 1 1 2 3 1 45 1 2 1 2 1 6 1 1 1 3 1 1 3 4 9 1 1 1 4 20 1 2 1 4 5 1 2 1 2 1 76 1 82 1 1 1 4 1 2 1 2 1 2 3 1 2 10 1 1 3 1 5 1 7 1 1 3 4 1 2 3 1 1 3 1 1 2 3 22 1 38 1 1 1 3 4 5 1 46 1 1 2 4 1 6 1 8 1 2 1 2 1 6 7 1 2 1 1 3 1 1 6 9 10 18 1 28 1 1 1 2 1 5 1 2 1 1 2 11 13 1 2 1 45 1 2 3 1 2 6 1 8 1 1 3 4 1 6 1 1 2 1 1 1 21 1 2 3 1 1 2 3 1 1 2 4 1 2 10 1 2 14 1 1 1 87 1 2 1 2 138 1 2 1 1 2 6 1 1 3 4 1 2 1 1 2 1 4 1 7 8 1 1 1 2 15 164 1 2 1 1 1 3 1 6 1 2 3 1 2 1 4 14…

Example 3:

Input: 3102 99688166 932486780 877517734 603977168 27953395 922637792 215780867 402073839 463283487 562968213 566987925 7758972 986365975 417831165 169828585 559620442 282000966 641088958 354913158 212869742 638534711 515857466 682671525 43265392 562199331 48796343 879691548 478901153 274920826 385459653 38517581 662800710 930555126 105046671 737763103 865345408 740576725 676498631 669970590 609955257 548432145 567743558 189379423 518059155 47797716 279705542 942961607 861587716 784138685 425589831 365940780 980280559 819670666 225558183 465259603 106006894 356401809 810974440 474592251 766600799 919905025 775725589 114323841 102300029 393829008 801625674 650766523 104195862 599230118 387882526 313515680 390032258 847272169 494720547 866892288 54367325 637116599 743015393 324939050 640861886 5429…
Output: 1 2 1 1 1 4 1 2 3 4 5 1 13 1 1 3 1 5 1 1 3 1 10 1 2 1 14 1 1 2 1 5 20 1 2 3 1 1 1 1 1 2 1 2 1 2 34 1 1 1 1 39 1 1 2 1 2 5 1 2 9 1 1 1 3 5 1 1 2 1 1 3 12 1 14 1 2 3 1 2 1 2 1 23 1 2 1 88 1 1 3 1 1 2 7 1 2 3 4 5 1 1 2 1 1 1 1 7 1 1 3 11 13 1 2 21 1 1 2 25 1 2 1 2 3 1 1 1 34 1 36 1 2 1 4 1 1 7 1 1 1 3 12 13 1 1 2 4 1 6 1 2 9 1 1 3 1 158 1 2 3 1 2 1 1 3 1 1 11 1 2 3 1 2 3 4 1 1 2 3 12 1 2 3 1 5 18 1 1 1 1 4 1 1 7 27 1 2 1 2 32 1 1 3 1 2 1 4 1 6 1 1 3 1 11 1 2 14 1 16 1 2 1 2 3 1 2 6 1 1 2 28 1 2 1 4 1 2 7 1 2 1 2 5 1 2 3 4 10 1 2 1 1 3 1 2 1 26 1 1 92 1 1 1 1 5 6 1 1 9 1 2 3 4 1 2 7 1 18 1 2 1 1 3 1 1 6 1 8 11 30 1 32 1 2 1 2 1 38 1 1 3 1 1 1 1 5 1 1 2 50 1 1 3 4 1 6 1 1 3 1 1 1 3 5 1 2 1 4 1 162 1 1 2 1 5 1 2 3 4 5 1 1 2 3 4 1 2 1 2 10 1 1 23 1 1 2 3 1 6 1 8 1 1 3 4 1 2 15 1 2 1 4 1 1 3 4 1 1…

Constraints:

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

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