CT37856

The marks Streak Back Puzzle

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

At the wren hedges of Thimblewick, Elio records each marks in a worn leather ledger. The guild wants answers, not guesses. 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: 1603 511655543 897981605 912362794 657316751 587017632 873907396 428187338 660887044 589435257 446703450 100812340 620375739 268263593 147734532 205790114 732289134 72747419 415335705 76759576 738806949 915334164 458842614 185649472 920941806 733287415 297091731 614542785 692911076 168637891 78876769 327922178 73094596 57961856 988951336 710491867 844210101 288811389 670564086 416175231 987687659 186445226 148956660 765946262 825658443 813491925 711496025 91378154 239204535 652989023 397008536 748601640 82568567 3795686 62431321 881014160 243742226 661695991 473314192 708881913 139566738 447303885 800407923 134986465 527203796 162702676 595389604 841650108 228581047 163827421 110964306 317463956 697332473 722660943 519070611 523914632 146667410 672505641 263877424 256534878 454445940 24276…
Output: 1 2 3 1 1 3 1 2 1 1 1 4 1 1 2 10 1 2 1 14 21 1 1 24 1 1 2 3 1 1 3 1 1 34 1 2 1 2 1 6 1 1 3 4 1 1 1 2 3 1 6 1 1 2 15 1 2 1 4 1 2 7 1 2 1 4 12 1 1 1 4 5 6 1 2 1 4 1 1 3 1 1 43 1 2 3 4 5 1 2 8 1 2 3 1 1 2 1 16 1 61 1 1 1 1 2 1 1 7 1 1 3 1 2 1 1 1 16 1 19 1 1 3 1 2 25 1 2 1 4 5 92 1 2 1 2 1 1 2 1 9 1 1 3 1 2 3 1 1 2 4 1 2 1 2 3 4 1 1 1 20 1 2 32 1 1 2 1 2 1 4 1 1 1 11 136 1 2 1 2 3 1 7 1 1 10 1 2 1 1 2 3 1 8 1 10 1 1 2 3 5 1 2 8 1 1 1 3 5 14 15 1 2 1 4 20 177 1 2 1 1 3 1 1 1 7 1 1 3 1 1 6 7 1 1 2 1 1 3 7 1 2 1 1 5 1 2 3 1 17 1 1 3 1 1 2 1 8 1 1 3 1 1 1 4 226 1 2 1 2 3 1 1 1 4 1 2 1 4 1 2 14 1 18 1 2 3 1 1 2 4 1 6 1 1 2 1 2 1 7 8 1 10 304 1 2 1 2 1 2 1 2 1 2 1 1 3 1 1 12 1 2 1 20 1 1 1 2 5 1 7 1 2 10 1 2 1 4 1 2 1 4 1 6 7 12 1 14 1 1 3 18 1 1 3 1 2 3 1 1 6 10 1 2 1 14 1 2 1 1 3 4 5 1 1 10 25 1 …

Example 2:

Input: 625 40812405 282344798 985721707 375302937 883548122 870328943 123578628 860370739 211796014 713564381 388590702 303772351 243276927 9175904 952396263 260749781 719403921 435087445 870122901 897614259 13025609 982497457 484860472 119402957 362391556 374461254 705727091 639898900 528811852 597906706 850858827 17703832 674953718 129111293 443336246 401268456 473278366 523074142 55527005 463242928 430764933 384451733 632686661 48784206 810306106 99826937 497161315 308519778 960183569 944573566 511577088 729227818 39204412 418444620 569918918 454565346 381840499 677255913 88155238 671650792 89238155 887401520 663327347 48502935 892645708 860188909 444507826 915546459 268533723 297373663 969263053 923747199 594106884 59884168 45162912 44052127 906801046 527137364 881132963 519407689 995255833 8…
Output: 1 2 3 1 2 1 1 2 1 2 1 1 1 1 12 1 2 1 4 5 1 19 1 1 2 3 5 1 1 2 9 1 2 1 2 1 4 5 1 2 1 1 10 1 14 1 2 1 27 1 1 2 1 2 3 1 1 6 1 2 1 12 1 1 15 1 1 18 1 2 49 1 1 1 1 1 5 1 2 1 81 1 1 3 4 1 2 3 1 1 3 1 1 2 4 5 9 1 14 1 2 1 2 1 2 1 6 9 1 1 2 4 1 1 2 8 1 10 1 1 3 41 1 1 2 1 1 1 1 2 3 1 2 1 1 2 12 1 2 1 1 1 6 1 22 1 1 3 4 1 2 1 2 5 1 2 3 1 1 3 4 1 2 10 16 1 18 1 1 48 1 2 1 4 1 2 3 8 1 2 3 4 1 1 3 4 9 10 1 68 1 1 3 1 1 1 7 1 2 1 2 3 4 14 1 16 1 2 1 1 1 1 2 8 1 2 1 1 3 1 1 6 17 1 2 1 21 1 1 2 1 2 5 6 1 1 3 1 2 13 1 1 1 4 1 6 1 1 3 1 2 1 4 5 1 2 1 4 5 1 1 3 4 10 19 1 2 28 1 1 3 1 5 6 1 2 1 10 1 2 1 1 5 1 2 1 1 2 6 1 1 3 1 26 1 56 70 1 1 1 2 3 1 2 1 1 9 1 2 13 14 1 2 1 2 1 1 3 4 5 6 1 1 2 1 1 2 1 5 19 1 1 36 1 129 1 1 3 1 2 6 7 1 2 3 4 1 1 1 2 229 1 2 1 2 3 1 5 1 2 1 9 1 2 1 4 14 1 1 1 4 1 1 3 4 1 6 1 2 …

Example 3:

Input: 1032 312064774 256291118 116297715 656347298 975443827 570899661 726177574 570781647 726933659 887669984 824762852 889011815 930887764 379166223 260308679 619893851 394478629 702881624 210134925 637625897 687636000 77131449 29942648 412530114 823355517 5329483 505265567 538315606 850760513 837851518 809009869 595066686 724330823 790498882 836170294 606964119 648164079 208463144 53254360 354607086 237484861 288039624 745515876 590893495 144179136 12136635 230580054 738748069 205197394 254377128 424202628 447692605 273842113 295807764 351144603 598847032 761578638 189511940 439952481 549662834 706323208 426290050 81327851 969714861 155494350 625205323 417127658 626021578 721942833 37088088 156641836 222415114 893055946 611315623 606275665 233248752 3977900 904916177 186652410 580103020 66101…
Output: 1 1 1 4 5 1 2 1 4 5 1 7 8 1 1 3 1 5 1 2 3 1 1 3 12 1 2 3 16 1 1 1 2 3 5 1 2 1 1 3 1 2 8 1 1 1 3 5 1 2 3 4 1 2 3 8 22 1 2 3 4 1 1 59 1 2 1 4 5 1 2 3 9 1 1 1 1 14 1 2 1 2 3 1 1 22 1 1 25 1 1 3 1 2 3 96 1 1 3 1 1 2 7 1 2 1 107 1 1 3 4 1 2 1 1 5 6 1 2 9 1 2 3 1 1 1 7 1 9 1 2 3 4 1 2 16 30 1 2 1 1 5 1 2 1 4 10 11 1 1 2 3 1 1 2 3 8 9 22 1 2 3 4 1 1 2 8 1 2 1 12 1 2 3 1 17 1 1 3 1 2 3 7 1 2 1 4 1 1 3 1 1 6 1 2 59 1 2 1 63 1 2 1 2 1 1 2 6 1 2 1 10 1 14 1 1 17 1 2 1 2 1 23 1 1 3 1 2 3 7 8 1 2 1 2 1 1 5 1 7 18 42 1 2 1 139 1 2 1 1 5 6 7 8 1 1 1 3 1 1 15 1 2 1 1 1 3 5 6 1 10 272 1 1 3 4 1 2 7 1 9 1 11 12 1 2 3 4 1 1 3 1 9 22 1 1 3 4 1 2 1 1 2 4 33 1 2 1 2 1 2 3 6 1 2 3 4 1 1 1 8 1 2 1 2 5 1 2 1 9 1 1 3 1 2 1 4 1 2 3 8 37 1 2 1 2 3 4 7 1 2 1 1 3 1 5 1 1 2 1 5 1 2 3 4 1 2 1 2 9 1 21 101 1 2 1 1 2 3 1 2…

Constraints:

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

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