CT40514

The Crowhaven Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Elsa inherited the loom house at the rookery of Crowhaven along with its curious bookkeeping system for beacons. Time to make sense of it. 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: 2100 251957135 209023430 947298092 232276025 624671443 636991254 950815178 694600906 304948709 948356080 87050218 718784269 433999244 285186082 436759350 681201629 771552520 693393819 371710096 282975383 754187575 88121932 997028631 153566487 489079429 550181531 10854466 305404990 219970249 470467903 66735244 7974765 501473410 427578703 397218578 618882813 611946131 685067577 422471245 573842684 829601078 471819872 91598105 56062082 771997921 201184015 589330429 701044688 630792736 705096948 869689695 33716252 898366860 732445025 30658446 582754991 651527371 537835685 617196220 207144745 602719411 792097998 131250404 808104236 799335655 233315180 356638663 593216567 930877390 561566106 314652722 102539081 468124988 764118269 378279954 707814362 329413115 496395512 532316981 559755241 47041…
Output: 1 1 3 1 2 3 7 1 1 3 1 2 1 1 3 4 7 1 1 1 4 1 23 1 2 3 1 2 1 4 1 1 7 1 1 13 1 15 1 2 18 1 1 1 4 1 2 3 1 5 28 1 30 1 1 2 3 1 2 1 2 9 1 11 1 1 2 3 46 1 1 1 3 5 1 2 1 2 3 4 1 1 2 1 11 63 1 2 3 4 1 1 3 1 72 1 2 1 1 77 1 2 3 4 1 1 2 3 5 10 1 2 3 1 1 3 1 5 1 1 3 1 1 6 15 1 2 3 19 1 21 1 2 1 1 1 3 1 2 1 1 3 1 2 1 2 1 11 18 1 1 2 1 2 3 4 5 6 1 2 1 4 5 1 34 1 2 1 2 1 6 7 1 1 3 1 1 13 1 2 16 1 1 19 1 1 1 78 1 2 1 2 1 6 1 2 3 1 1 6 1 2 1 16 17 1 2 1 2 1 1 3 1 7 1 9 1 1 31 1 2 1 2 5 1 7 8 1 1 2 1 2 1 7 1 1 2 4 1 1 14 1 1 1 4 1 2 1 1 1 6 7 1 1 2 11 1 1 2 1 2 3 1 8 1 10 1 1 2 4 1 2 17 1 2 3 1 1 1 3 5 6 1 57 1 2 3 1 1 6 64 1 1 2 3 5 1 1 2 4 1 6 1 8 1 2 1 1 2 6 1 16 1 2 3 4 1 1 2 1 9 1 2 28 1 2 1 2 1 2 1 2 1 1 5 6 1 1 2 1 5 14 1 2 1 2 3 1 1 24 1 1 2 1 5 1 61 1 2 3 4 1 1 3 1 5 1 1 2 4 1 1 1 17 1 2 1 1 2 1 1 …

Example 2:

Input: 2626 327885218 260590257 56792763 240795641 829075879 87618153 266567785 815978980 835028160 385335529 76045034 988533435 296798827 130616751 712972840 974662889 109638164 89410593 268648107 702179083 288339043 827630947 107729056 736877221 578947902 280307397 729093511 402166558 59909836 618892847 753740345 617406078 764214838 77950931 939661048 895231265 434119015 730185202 355572726 764040330 873179844 896081981 989868039 242472726 557025957 254372700 953895188 418296590 230921181 611878110 227613347 852508856 300512043 598182527 121621911 317627440 593871458 87083707 44430385 176990785 577777778 618326642 516360989 477215340 450618610 427527893 584715083 152277695 880920868 46357882 212259141 506357075 254237540 988832306 187439738 804464610 117459397 378326736 717244029 893615890 8229…
Output: 1 1 1 2 5 1 2 3 9 1 1 12 1 1 3 4 1 1 3 4 1 6 1 2 1 1 3 1 1 3 9 1 11 1 19 1 1 2 1 4 5 7 43 1 2 1 4 1 1 3 1 5 1 2 1 2 3 1 1 3 4 10 1 1 1 1 5 1 22 1 2 3 1 31 1 2 1 2 3 6 1 1 1 3 1 2 13 1 2 1 1 2 3 20 1 1 23 1 1 3 1 28 1 1 1 4 1 6 1 1 2 10 1 1 1 4 1 2 1 2 3 1 7 1 2 1 2 26 1 1 131 1 2 3 1 1 3 1 5 1 1 3 1 2 1 1 5 14 1 2 1 2 3 1 1 3 1 5 1 1 3 1 1 1 4 8 9 1 2 1 2 3 4 5 1 2 3 1 45 1 2 1 1 3 1 1 1 3 4 1 1 3 4 15 1 2 1 4 1 2 1 4 5 1 1 3 1 5 78 1 1 3 4 1 2 1 4 1 6 1 2 9 1 2 225 1 1 2 1 1 6 7 1 2 1 11 12 1 2 1 1 1 6 1 1 1 3 5 1 1 2 9 1 1 1 13 1 1 1 2 1 4 1 2 1 2 1 25 1 1 1 1 1 5 6 8 1 1 3 1 2 3 7 1 2 1 4 1 1 65 1 2 1 4 5 1 2 3 1 1 1 3 5 1 2 3 1 18 1 2 1 2 1 2 1 4 1 6 1 1 2 3 1 2 1 7 1 9 1 1 1 2 4 1 2 3 4 30 1 1 3 1 35 1 37 1 2 3 1 2 1 1 1 4 65 1 1 2 1 1 1 6 1 2 1 1 5 12 369 1 2 1 4 1 2 1 2 5 1 11 1 2 1…

Example 3:

Input: 332 363791008 407525730 12054075 200139920 683667049 937203168 515296542 242328418 249722816 28789570 280842046 808644772 174649736 43943575 288106109 656088304 586219517 316680543 744825058 100300284 818512583 428656237 182577783 281622457 380618323 640858225 335711489 451471531 251455603 577543459 131149365 23445930 376575787 864499814 853031252 894339534 894162292 972997790 363960390 63686471 326572120 28190165 814954616 819297003 671847802 514866383 258570568 517547030 726163454 593506323 614509676 130212026 423431654 592602926 184877013 193119909 116668025 253443345 686676555 45982227 563249429 241646075 695512824 88161895 869715940 82290630 619390331 930850146 474029010 733632527 717994997 701961563 722813277 738729288 45366280 958927717 747535724 236919130 515102367 697170131 179126…
Output: 1 2 1 2 5 6 1 1 2 1 4 6 1 1 3 4 1 1 7 1 15 1 1 2 3 5 1 2 1 4 1 1 3 28 1 30 1 38 1 1 2 1 5 6 1 1 1 3 5 1 2 1 2 3 1 2 1 4 10 1 2 1 14 1 27 1 2 30 1 2 1 1 3 6 1 38 1 1 2 3 1 2 1 8 1 2 1 1 13 1 2 1 1 1 1 3 1 2 10 1 2 1 4 1 2 3 8 1 1 1 2 112 1 1 2 3 4 6 1 2 1 4 1 2 3 1 1 2 3 4 1 1 8 1 2 1 25 1 1 1 2 5 1 2 1 1 2 4 1 2 1 8 1 2 1 44 1 1 1 3 5 50 1 1 3 1 1 3 1 5 1 2 1 2 1 4 1 1 3 18 1 2 3 1 1 24 1 2 3 28 1 2 1 1 3 84 1 1 2 1 2 1 2 1 4 10 1 2 1 1 1 3 4 1 9 104 1 2 1 4 1 1 3 1 1 10 1 1 1 1 3 6 17 1 2 1 2 1 1 1 4 9 10 28 29 1 1 2 1 5 1 2 3 1 143 1 2 3 1 1 3 1 2 1 4 1 2 3 4 1 2 14 1 1 2 164 1 1 2 4 1 2 1 8 1 10 1 2 1 1 15 1 1 1 1 5 1 22 1 1 2 4 1 1 1 2 1 2 33 1 2 1 4 5 1 1 3 1 1 3 1 2 1 10 1 2 51 52 1 1 2 1

Constraints:

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

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