CT45902

Moonlit ledgers Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the copper works of Verdigris; Harish weighs the day's ledgers 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: 989 572138556 86436622 347704025 295764710 553441147 250667631 229206784 118062406 402460431 599450307 912051054 237874459 531547154 156218071 429116646 253173989 822769593 156822321 396793424 78733933 414531157 735652595 691308647 898504470 248427312 634786808 74042890 607262079 616267551 957718586 125946838 924647585 841722467 515614692 375208643 676870841 22019415 506051586 722543499 356464943 579244092 523762699 4834341 871381603 536556627 574388962 208384349 673761936 594670753 572099168 167878385 296439893 30923767 938806886 39097806 892924442 438236958 415902370 295182962 508504217 377859741 261005268 223331846 510616989 929660059 326111045 687260291 670603459 688761125 978547635 964727973 332802849 643246868 391237322 775470883 280410009 649605252 924349897 554794308 426506762 1456…
Output: 1 1 2 1 4 1 1 1 4 10 11 1 2 1 2 1 6 1 2 1 4 5 1 13 1 2 1 2 3 30 1 2 1 1 1 3 1 2 6 1 2 1 1 12 1 2 1 4 1 1 1 2 1 24 1 2 1 1 1 4 1 1 1 8 11 1 2 1 4 70 1 1 2 1 4 1 2 7 1 1 1 2 5 1 1 8 1 1 2 1 2 1 1 7 1 10 1 1 2 100 1 2 103 1 2 3 1 1 1 3 4 1 6 1 9 1 1 3 4 1 2 1 2 1 2 3 12 13 1 2 3 1 1 1 2 4 1 2 1 37 1 2 1 2 5 1 1 2 9 1 1 3 1 2 1 4 8 1 1 2 4 1 6 1 2 63 1 2 1 2 3 1 2 1 1 1 11 1 76 1 1 3 4 1 2 1 2 5 1 11 1 1 3 1 2 3 1 1 2 3 1 6 1 2 15 1 2 3 1 1 2 1 23 1 2 1 4 39 1 2 1 2 1 6 1 1 3 1 2 3 1 1 3 7 1 9 1 2 12 1 2 15 1 1 2 3 29 1 2 3 1 1 6 1 1 1 3 5 1 2 1 15 1 2 1 2 3 4 7 1 1 3 1 5 1 14 1 2 1 4 1 1 7 1 2 3 1 12 1 2 1 4 1 1 7 1 2 1 1 1 2 1 1 2 7 1 12 1 2 1 4 1 25 1 2 3 1 2 1 7 1 1 3 11 107 1 2 3 4 1 1 1 1 4 1 1 1 2 1 2 11 1 14 15 1 2 1 4 1 1 3 4 1 1 2 1 5 1 2 3 1 10 1 1 3 1 1 6 1 370 1 2 1 2 1 6 1 1 3 1 …

Example 2:

Input: 2143 13619239 252240189 680258588 254753283 758761185 811025164 578796440 234550701 900699043 703239297 910251566 925836931 804845617 592099877 663566009 388010962 522573425 903790905 485251543 587830190 362761593 35946195 859204615 937951897 313309694 376383966 309674506 484667233 659934995 750746147 814578143 782690589 488956193 187119367 940852094 123975650 214402764 14904704 726094744 765119484 699725533 841735750 863400098 285268719 984989240 950155845 347052213 926690605 110378541 611365513 619538207 366360579 304456910 592697202 105815858 926502631 128707684 151014757 136590657 978227189 830585487 957817959 315332129 107264175 649962637 173410848 168266137 665710605 943434877 36938369 542738135 994941182 879873435 245890881 671671061 250073344 362299672 949971596 597183386 512734556…
Output: 1 2 3 1 5 6 1 1 9 1 11 12 1 1 2 1 2 6 1 2 1 1 5 24 1 2 1 4 5 6 7 1 1 1 35 1 2 1 4 5 1 7 8 1 45 1 1 2 1 2 3 1 1 3 1 8 1 2 1 15 1 2 1 1 3 1 1 6 7 1 2 72 1 1 2 1 2 6 1 1 1 2 4 12 1 2 1 2 3 1 5 6 1 2 1 1 13 1 1 3 4 5 1 2 1 4 1 2 3 8 1 15 1 1 31 1 2 3 1 5 1 1 2 1 1 1 3 56 1 2 1 2 1 2 1 1 3 1 9 1 2 70 1 1 2 4 1 2 7 1 2 1 2 5 1 2 1 2 1 4 1 1 2 3 1 2 3 4 5 9 17 1 1 2 3 27 177 1 1 1 1 5 6 1 2 3 1 1 2 1 4 6 1 2 18 1 1 3 1 1 6 7 1 2 10 1 2 3 1 1 1 3 5 6 1 1 12 1 14 43 1 2 3 1 1 2 7 1 2 1 4 1 2 3 1 2 1 2 1 13 1 2 1 4 1 69 1 2 1 4 1 2 1 1 3 10 1 2 1 14 15 1 17 1 1 1 1 2 4 1 2 9 1 2 1 4 1 2 1 4 1 10 1 12 1 2 1 1 5 1 2 1 1 2 1 2 5 9 1 1 1 4 5 1 2 1 9 1 1 2 3 1 1 3 1 2 1 2 1 1 1 1 16 1 2 1 4 1 2 1 1 3 4 7 1 13 1 2 1 2 1 19 36 1 1 2 1 2 60 1 1 2 1 1 1 4 8 181 1 2 3 1 5 1 1 2 3 10 11 1 2 1 2 1 17 1 1 3 1 2 …

Example 3:

Input: 1860 849487141 938626677 304300390 803287286 202424923 572170297 324971694 337437542 117464984 216333342 693002883 230468932 477358017 913151187 194056553 549333535 734952281 605560643 747417837 122150515 481683597 578718687 681465672 390095368 949108262 73956490 904958806 734800213 520408738 165190027 890135793 341806270 433886578 876983458 134806258 615665787 623007137 68383683 970500699 740138627 469468940 602808183 388806594 986238308 769217743 796667651 681586751 223699787 349690013 483171899 395139654 628018021 826086967 448804931 936417782 615440310 995364720 707207380 429474583 641386194 430012916 277458752 277875385 257150593 161521679 600802010 768723102 255164904 682240171 182851305 342024822 961366533 57423554 576297186 817780881 154471765 745982517 52710394 438309114 760668389…
Output: 1 2 1 2 1 2 1 2 1 2 7 1 2 12 1 2 3 1 5 1 2 3 4 1 25 1 2 1 1 1 4 1 2 3 1 2 3 1 39 1 1 2 1 44 1 2 1 1 2 3 1 5 9 1 11 1 57 1 1 2 1 1 2 1 1 6 10 1 2 1 2 15 1 2 3 1 2 1 2 5 1 10 1 1 2 1 4 5 1 2 1 1 3 1 12 13 1 2 1 2 1 1 2 4 1 8 1 12 1 1 2 4 1 1 2 1 2 1 11 1 1 1 3 16 1 30 1 46 1 2 1 4 1 1 2 4 1 56 1 2 3 1 2 1 1 5 1 1 3 4 10 95 1 154 1 2 1 2 1 1 1 4 5 1 11 1 2 3 1 1 1 2 5 1 1 2 3 4 5 1 1 1 29 1 2 1 2 1 1 7 1 1 3 1 2 1 1 2 16 17 1 2 1 1 5 1 2 8 1 10 1 2 1 1 3 1 2 1 7 1 11 1 2 3 4 1 1 1 3 20 1 1 2 4 1 2 1 1 2 3 4 5 43 1 2 1 4 1 1 3 68 1 1 2 3 5 1 1 2 9 1 1 12 1 2 1 2 1 4 5 1 2 3 1 2 13 1 15 1 2 18 1 1 33 1 2 1 4 5 1 7 1 2 1 44 45 1 2 1 2 1 4 1 1 2 3 5 1 7 1 2 1 2 5 1 2 19 1 1 3 1 1 2 4 5 75 1 2 3 4 1 6 1 151 1 1 3 1 2 6 1 2 1 2 1 4 1 2 7 1 1 1 4 1 2 1 174 1 1 2 3 1 1 3 4 5 1 1 8 13 1 2 16 1 2 1 2 1…

Constraints:

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

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