CT35265

The Streak Back of Scrollkeep

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the archive halls of Scrollkeep, someone must approve the repair estimates. This year the task falls to Bishop, armed only with the ledgers register. 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: 1449 49129124 784109325 132217541 821455059 718613760 882226169 42221457 329870369 838021957 692872671 668611515 509383291 737279347 950650150 973159425 761890390 417653899 318981980 561873001 470359394 942809610 246821325 469765598 541230862 640441837 658410125 679530606 23341738 415799544 187884178 891500502 251935053 803629750 159706675 546683130 613126223 999552737 849935167 901062795 226821390 502431996 378200630 538887293 277699471 642363971 381731208 336141368 420057367 933376115 809216549 406453732 901586239 564538282 85879036 186156189 913888938 650379709 162512315 371941544 881436926 534775256 147063706 342660208 332359250 542707143 17003381 455820912 581220684 274255979 598761523 309574243 395915716 485897548 384770889 976044466 722937062 523970454 544737338 659138180 680404855 …
Output: 1 2 1 4 1 6 1 2 3 1 1 1 4 14 15 1 1 1 3 1 6 1 2 3 4 5 6 1 2 1 10 1 2 1 2 3 37 1 2 1 2 1 4 1 6 1 1 3 12 1 1 3 1 1 2 7 1 1 2 4 1 1 2 1 5 1 2 8 1 10 1 2 3 1 38 1 1 2 3 4 6 1 1 47 1 1 2 1 4 6 1 2 3 4 1 1 7 1 1 3 1 1 1 2 4 1 1 7 8 1 14 15 1 1 3 1 2 3 7 23 1 1 3 1 1 2 1 1 3 33 1 1 2 50 1 1 1 1 5 1 7 1 59 1 2 3 4 1 1 7 1 115 1 1 2 1 5 1 1 1 2 10 1 2 1 2 130 1 2 1 4 1 2 7 1 2 1 1 5 1 1 2 4 5 1 7 13 1 1 1 4 1 1 1 4 1 10 1 2 1 1 1 1 7 1 2 1 11 1 2 1 4 39 1 1 1 4 1 6 1 1 2 3 4 12 1 2 1 2 5 1 2 1 9 1 2 1 4 1 2 67 1 1 2 3 1 5 1 1 1 3 11 1 2 1 1 2 1 1 3 6 1 1 3 1 2 3 1 2 16 1 2 1 4 1 1 3 4 1 10 1 2 1 4 1 6 1 1 3 49 1 1 1 2 1 4 1 2 132 1 1 2 1 4 1 1 3 9 1 2 1 4 1 1 2 3 5 1 2 3 1 2 1 7 1 1 2 3 5 13 1 1 16 1 1 2 1 30 1 1 3 1 5 1 1 3 1 1 3 1 1 3 7 46 1 1 3 1 2 6 1 2 1 4 1 1 2 1 1 6 7 12 1 2 3 1 2 1 2 1 2 10…

Example 2:

Input: 388 823109048 823620311 733785951 589338082 498850155 959486698 987265063 835817575 102597627 565896414 905526079 538449506 189088628 8177855 293145834 342884760 996547737 632555630 25845296 521311265 411661931 119783657 266761155 983687606 320951811 343866392 804164060 384220648 334650164 979028772 306542620 411453875 319917261 367902277 751230694 619066443 685677032 299565025 784522512 125387353 619230140 788037717 818754738 350664440 793133264 315554514 125070398 109143529 627116245 875782382 881419127 681021759 665203825 982812036 554186813 306410090 139643259 561360064 699417069 785973577 558409892 290414693 566335244 360738288 174002689 761246549 827650785 622295208 114300669 667184184 630367158 577030164 892694305 127688592 882881577 135758302 615740637 691736568 897457751 473705587…
Output: 1 2 1 1 1 6 7 1 1 2 4 1 1 1 3 4 17 1 1 2 1 1 2 7 1 2 3 1 1 6 1 2 1 2 5 1 2 1 9 1 2 12 13 1 2 1 1 1 4 20 21 1 1 30 1 1 1 4 5 6 1 1 3 1 1 6 13 1 1 3 1 1 19 1 2 1 2 3 25 1 1 1 2 4 1 2 8 1 10 36 1 1 1 1 1 3 1 2 1 2 10 1 2 1 1 5 6 1 1 20 1 1 3 1 25 1 2 3 1 2 3 4 5 34 1 2 1 4 1 1 3 1 1 3 1 5 9 14 1 1 1 1 1 5 1 2 1 2 5 6 1 62 1 2 3 1 140 1 2 3 1 1 3 1 1 3 1 2 1 2 3 155 1 1 3 4 1 1 2 4 5 1 2 1 2 5 15 1 2 1 1 3 1 7 1 1 1 2 3 13 1 2 31 32 1 1 3 4 1 2 1 2 5 1 2 8 1 2 1 4 49 1 1 1 3 4 1 228 1 1 3 1 5 1 2 1 1 3 1 7 1 1 3 1 5 1 1 3 1 5 1 2 3 4 10 1 29 1 2 1 1 2 1 1 8 1 1 1 4 1 2 3 4 1 2 19 1 2 3 1 5 1 2 1 2 58 1 1 3 1 2 6 1 2 3 1 11 1 2 1 1 16 1 1 3 1 1 3 4 5 1 1 3 4 1 2 1 1 2 4 11 36 1 324 1 1 3 1 1 6 1 1 3 1 1 6 1 2 1 4 1 1 2 4 1 1 1 18 1 1 3 4 1 2 31 1 2 1 2 5 1 2 3 9 1 2 1 13 14 46 1 2 1 4 1 1 1 4 1…

Example 3:

Input: 2762 38539882 699016752 362254381 596748423 997178172 889536068 371585763 536632016 460588800 854397441 413925485 3439818 845783138 72345538 260321368 138524260 641004655 883729155 319643831 958402166 957619190 621571482 976021764 677248740 625059737 846357602 43361138 748747556 574547643 815485843 535986236 756353766 834644439 224920122 732237210 928245067 599583830 432946268 796983726 228177975 821636198 88823561 964109494 137897797 407754602 373894827 228815974 322351508 817913811 718288076 334069604 522091676 362432769 195879959 129458720 628821063 176946714 378581836 887725239 334268274 797853772 30115297 129175648 585927157 989017450 951135378 16516226 418558187 994153204 94744601 34482486 345631024 598325816 844009160 297516143 611045457 557363820 341754457 295656007 968529371 57470…
Output: 1 2 1 2 5 1 1 2 1 4 1 1 3 1 2 1 4 12 1 15 1 1 18 1 1 3 1 2 1 4 1 2 7 1 2 13 1 1 3 1 5 1 20 1 2 1 1 2 6 1 1 2 1 1 1 6 1 2 16 1 2 1 2 3 60 1 1 2 64 1 1 3 4 5 1 2 1 1 1 11 1 1 3 4 1 2 1 1 5 6 11 1 1 3 1 2 1 4 1 9 1 1 12 1 2 3 38 1 2 1 2 3 4 1 1 9 1 2 1 2 1 4 123 1 1 3 1 2 6 1 2 1 2 1 4 1 2 1 2 1 1 3 6 1 14 17 1 1 26 1 1 3 1 2 1 1 34 1 1 2 1 1 1 1 5 1 2 1 12 1 1 15 1 2 1 1 5 1 2 1 2 3 6 1 2 14 1 16 1 18 1 2 1 2 1 6 1 8 1 2 11 1 1 2 4 1 6 1 1 1 4 1 6 24 1 1 1 4 1 2 3 1 1 10 1 2 1 4 1 16 1 2 3 4 1 2 1 1 5 1 2 1 2 30 1 1 2 4 35 1 2 3 1 5 1 2 1 4 1 2 1 4 1 1 2 1 13 1 97 1 1 1 3 4 1 2 1 1 9 1 2 3 1 5 1 7 1 18 1 20 1 1 1 2 5 1 2 3 1 30 1 2 1 1 5 1 1 8 1 138 1 2 1 1 3 4 1 2 1 1 5 1 11 1 2 1 2 16 1 2 1 4 1 24 1 1 1 4 1 1 2 3 1 2 35 1 2 3 1 1 6 1 1 1 45 1 2 1 2 1 1 1 2 1 5 6 1 9 1 247 1 1 3 4 1 2 1 4 1…

Constraints:

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

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