CT56664

Gail's Painted Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the sulphur springs of Brimstone as Gail unrolls the day's manifest of registers. 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: 950 460738852 311303239 808643193 273816365 738123179 892675670 306617141 382215886 76704181 35727467 183886073 778418041 251935045 923479200 894709408 670004328 993929104 768617909 764173986 243757193 227164497 593316261 536391848 317440054 705769004 451040607 787477886 335960296 876765516 756146486 656434654 643706052 592584916 712238829 53034642 588248051 9641354 515105868 50195463 84519252 801750765 613485632 923248780 645351920 80475543 375394741 330766839 42098421 684762069 817274291 819502874 65859388 413812501 449089248 102791503 977186017 316722125 736256173 118116606 689275283 3701385 846657756 506800305 974159574 163033030 322344675 640853834 545076905 300104700 617743634 3301567 255242419 71973659 968052970 621721912 395668015 206325593 48203782 67964359 231274949 148746088 551…
Output: 1 1 3 1 2 6 1 2 1 1 3 6 1 14 1 1 17 1 1 1 1 3 1 1 6 1 10 1 12 1 1 1 1 4 1 2 1 2 1 2 12 1 26 1 1 2 1 1 6 7 8 1 2 3 1 39 1 2 1 2 1 6 1 8 1 2 3 1 1 3 1 2 1 10 1 1 1 1 2 4 1 7 1 2 11 12 1 2 1 16 1 2 3 4 1 6 1 8 1 10 1 1 1 4 5 1 2 8 19 1 2 1 2 24 1 1 3 1 2 3 4 105 1 1 1 126 1 1 3 1 2 3 1 1 2 1 5 9 1 2 1 2 5 1 7 1 2 1 1 5 1 1 2 1 1 1 1 4 33 1 1 3 163 1 2 3 4 5 1 2 3 4 1 2 1 2 1 2 7 1 2 3 20 1 2 1 1 1 3 7 8 1 2 11 1 2 3 4 1 1 7 1 1 3 4 1 24 1 2 1 2 1 1 3 6 1 1 1 1 5 1 13 1 2 1 2 1 21 1 2 1 2 1 2 5 29 1 31 1 1 1 4 1 2 1 2 9 10 1 1 2 14 1 2 1 4 50 1 1 3 1 5 1 2 3 1 10 1 2 1 4 65 1 1 3 1 1 3 1 8 1 2 1 1 2 1 2 1 1 18 1 1 3 1 5 6 1 1 3 1 5 1 1 8 1 1 3 1 2 1 4 1 1 3 1 2 27 1 2 1 1 2 6 1 1 1 2 1 5 1 148 1 2 3 4 1 2 3 1 1 1 2 3 6 1 2 1 17 1 2 1 1 1 2 1 2 7 8 1 1 1 2 5 1 1 18 1 2 186 1 1 3 1 1 2 3 5 1 1 1…

Example 2:

Input: 1819 16984303 989026025 899570945 117794677 209632070 113440604 961059616 552108174 812049847 365913321 182513952 48921957 597469830 580977715 234222624 789965230 830078489 203000080 807564007 266036310 806886338 924586425 830882386 90060009 399070245 774065148 20925971 378810255 451084350 272002172 835400669 917283649 554549601 451883269 248919632 99943261 7435183 957644023 866022078 969265750 767213104 985472697 231203313 656136 50741510 301700469 145360339 511057439 852653696 24285340 75869916 141855357 939313009 428321351 551402281 519488423 668178833 412852852 692234531 997810013 865261868 794680269 879044375 250521435 504412301 298005844 909853445 990123416 874099437 256357508 50336398 237601714 37084916 601762653 414837687 192082882 351671027 970764558 631014817 634069633 507942835 …
Output: 1 2 1 1 2 1 5 1 2 1 1 1 4 1 1 7 10 1 2 1 2 15 1 1 2 3 1 2 3 1 9 10 1 1 1 1 1 31 1 38 1 40 1 1 2 4 1 6 7 1 2 3 11 1 2 1 4 1 6 60 1 1 3 1 2 1 7 8 1 1 1 2 1 5 1 1 2 10 1 2 1 1 2 4 7 1 1 10 1 2 1 4 15 1 2 3 1 2 1 1 2 1 25 1 2 3 39 1 2 1 1 52 1 1 1 3 4 1 2 7 1 2 10 12 1 1 2 4 5 1 1 2 1 5 11 1 1 3 1 2 17 1 2 84 1 2 1 2 1 2 1 6 1 2 3 10 1 1 15 1 2 1 4 1 1 1 2 9 1 1 27 1 1 3 4 1 1 3 35 1 1 1 3 40 1 1 3 1 1 2 4 5 1 1 1 9 13 1 1 16 1 1 3 4 21 22 1 1 3 4 1 2 3 8 1 2 1 1 3 1 1 1 4 1 2 3 8 9 1 16 1 2 1 4 1 1 3 4 5 1 2 1 1 2 15 1 17 1 2 3 4 1 1 2 4 1 1 2 4 5 6 202 1 1 2 3 1 5 6 1 1 2 11 1 1 1 1 4 1 2 1 4 1 2 1 2 9 1 1 3 1 1 2 1 1 34 1 1 3 4 1 40 1 42 1 2 1 2 47 1 2 1 2 3 6 7 1 2 3 1 12 1 2 1 1 2 1 1 2 1 331 1 2 3 4 1 2 1 1 5 6 1 1 2 1 1 2 6 1 8 1 1 1 1 3 4 1 6 1 2 3 1 13 1 1 1 1 4 1 6 1 1 1 4 1 1 7 14 1…

Example 3:

Input: 2188 601751698 950063966 50636781 693021595 488356496 416111827 247420351 810594485 448181743 802679289 475434943 299214596 118834156 111520524 303206293 510621313 330583217 12731654 680377290 124241525 113474557 800864327 708894717 404944425 466464597 812282938 309092105 816996773 59621886 661340980 461192836 875078000 616858036 846410651 337036903 1429260 315120091 391001473 997125382 893320124 988017941 541757249 98998257 109817268 665088336 98307761 380384689 492660796 493093624 379714403 770141165 202407586 338266253 168168401 494280279 650647328 168533846 358859644 735645609 821990498 12345388 171793326 159885415 695091589 447665585 187112880 335447069 571236854 219272542 580510747 485932940 361514612 607522177 907062713 268799894 866394653 429805369 60017977 449780084 272225864 9143…
Output: 1 2 1 2 1 1 1 6 1 2 1 1 1 1 4 6 1 1 9 1 1 12 1 1 2 24 1 26 1 2 1 30 1 2 1 1 2 4 39 1 2 1 1 2 4 1 2 3 4 1 10 1 2 1 4 5 1 2 8 19 1 2 1 4 1 1 2 4 1 6 1 1 9 33 1 2 1 1 3 1 40 1 2 1 1 2 4 1 1 3 1 51 1 1 95 1 1 3 4 5 1 7 1 1 1 2 3 5 1 1 16 1 2 1 20 1 22 1 1 1 26 1 2 1 2 1 1 1 4 1 8 1 2 11 1 1 3 1 2 6 1 1 9 1 22 1 2 3 1 5 1 2 1 1 3 1 2 13 1 1 3 4 1 2 1 71 1 2 1 4 1 1 2 3 4 1 1 8 1 1 11 1 88 1 2 1 2 1 2 5 6 1 1 1 10 1 12 1 1 3 4 1 2 3 1 5 1 7 1 1 2 3 30 119 1 2 3 1 1 6 1 1 1 4 1 2 13 1 2 3 1 2 1 1 2 1 4 1 7 1 9 15 1 1 3 1 5 1 7 8 1 1 1 3 13 1 1 2 1 2 6 7 1 1 2 11 172 1 2 1 2 5 1 1 2 1 1 2 3 1 1 10 1 1 3 1 2 1 1 1 2 3 6 9 1 1 2 4 1 2 3 1 18 1 1 3 1 1 6 38 1 1 1 2 1 4 1 1 3 1 5 1 2 3 1 2 15 1 1 20 1 1 3 1 1 2 7 1 1 1 3 1 33 1 2 3 1 2 1 7 1 2 1 2 1 4 1 15 1 2 1 52 1 2 3 4 1 1 97 1 2 1 4 1 6 1 2 9 1 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Gail's Painted Ledger - MEDIUM Coding Problem | CodeTikki