CT40364

The Amber Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the acacia flats of Thornveld, someone must fulfill a tricky customer order. This year the task falls to Freya, armed only with the marks 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: 13 39876858 999068804 275122114 587789445 645071345 354150500 940564613 475494467 246417429 616769403 544827093 327027797 180978520
Output: 1 2 1 2 3 1 5 1 1 3 1 1 1

Example 2:

Input: 936 440800628 694891160 615716832 516626270 914031790 253226182 238447993 716011664 754982426 969286517 248670306 585395305 690222566 560797562 106260753 674254684 611290450 942630631 668166404 819656993 21135388 590755135 598164996 528378795 544896003 705144958 484155933 60940464 731469614 773632014 736217277 114818229 590185546 122244368 116618648 338384111 329042158 440993149 239269210 713717400 773324624 73241671 141575163 909247334 34385178 382965650 818115567 526577308 654171071 89865989 262870891 266580437 86302546 382543002 396730348 394986469 537005004 353250164 71154130 707474940 143976294 527247913 297651172 358015073 628052165 566745645 771511800 888373761 95870916 595964314 514640345 247439075 362829558 154112903 932817865 944255260 797206708 78104499 501289358 622789786 42505…
Output: 1 2 1 1 5 1 1 3 4 10 1 2 3 1 1 3 1 8 1 2 1 2 3 1 2 6 1 1 9 10 1 1 2 1 1 3 1 5 1 9 11 1 2 26 1 2 3 1 2 1 2 3 1 5 6 1 8 1 1 13 1 2 1 2 5 1 20 24 1 2 1 1 2 1 57 66 1 1 2 3 1 5 1 7 1 10 1 1 3 1 91 1 1 2 1 5 1 1 8 1 2 1 1 3 4 5 8 1 2 1 4 1 6 1 2 3 1 2 1 1 5 1 10 1 2 3 36 1 1 3 1 2 1 4 8 1 2 1 2 5 1 2 3 1 10 1 2 1 2 1 4 1 2 1 8 1 1 2 4 1 2 1 18 19 1 1 1 23 1 2 1 2 1 1 7 8 86 1 2 1 2 3 1 5 6 1 1 2 1 5 1 2 3 1 2 1 2 5 1 2 1 2 1 1 1 27 1 2 3 1 2 3 4 1 2 1 4 1 2 1 1 3 4 5 1 1 21 228 1 2 3 4 1 1 3 1 2 3 4 5 9 1 2 1 4 5 1 2 1 22 1 2 3 1 1 3 1 5 1 7 1 1 2 1 5 1 7 1 1 1 4 1 2 24 1 26 1 1 3 1 1 3 4 5 1 7 1 2 3 1 2 13 1 2 1 1 1 1 5 1 2 8 11 1 2 1 57 1 2 3 4 1 1 1 2 9 1 2 1 4 1 2 16 1 1 3 4 5 6 1 1 2 10 1 28 1 2 1 32 33 1 1 2 4 1 1 1 2 9 1 2 3 1 14 15 1 2 3 1 5 21 1 1 3 1 2 6 7 1 1 1 11 12 1 1 1 3 1 6 1 1 …

Example 3:

Input: 1335 779855186 911539491 966143749 451932719 528255526 740951068 589722509 840385502 458309398 440223712 837868785 76722625 305810296 444729958 221848692 847177752 97249063 338697446 710963578 63229470 372863613 456089780 826721114 677843098 757508853 876647895 389557328 445184875 338832312 916841518 328712963 819404158 345773668 316780686 18540220 853243294 242261380 731208426 395139449 233383305 731928802 436290893 655261297 346576897 204697335 141605556 525682307 894042134 977486105 75394166 413531105 270675394 729597578 201647162 683383193 703316319 481483479 91262326 545779986 534438138 370071247 367061445 974769601 787371040 41029292 980678728 44376461 624993661 672154041 145920866 176450371 411007781 844501405 554665938 991248734 277431428 561670681 595387814 401550827 111158278 359…
Output: 1 2 3 1 2 3 1 5 1 1 3 1 2 3 1 13 1 2 3 1 2 3 7 1 2 23 1 2 1 27 1 2 1 1 1 6 1 2 1 1 5 1 2 1 1 1 4 18 49 1 2 1 4 1 2 3 1 1 3 1 1 1 14 1 1 66 1 2 3 1 2 3 7 1 75 1 2 3 1 1 2 7 1 1 10 1 1 1 4 1 2 1 4 1 2 1 12 1 1 15 101 1 2 1 2 3 4 7 1 1 1 11 1 1 14 1 2 1 4 5 1 7 1 1 2 4 1 2 1 1 3 4 11 19 1 2 3 4 5 1 1 3 4 5 1 2 1 2 3 1 1 1 7 1 9 1 2 1 1 2 3 4 1 30 1 2 3 1 54 1 2 3 1 5 1 1 2 77 1 1 3 4 1 1 1 2 9 1 1 1 3 14 15 1 1 2 1 97 1 1 2 3 1 2 1 8 1 2 1 1 1 1 2 5 7 1 2 1 1 2 4 7 1 1 2 1 5 20 1 2 3 1 2 1 4 1 6 1 11 1 1 14 1 1 3 4 1 1 1 4 1 24 1 2 3 1 257 1 2 1 2 1 2 7 1 2 1 2 3 1 5 1 1 10 11 1 2 1 1 3 4 25 1 1 3 1 1 2 1 33 1 2 1 1 2 1 4 1 6 1 1 1 11 1 2 1 1 2 4 1 2 1 1 2 1 5 1 1 16 1 2 3 1 5 1 36 1 1 3 4 1 1 3 4 9 1 2 1 2 14 1 1 1 4 5 1 1 1 3 5 1 12 1 1 2 1 2 1 1 2 35 1 1 2 4 1 6 1 1 2 1 1 1 2 7 1 10 1 1 1 …

Constraints:

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

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