CT48204

Weaver's Windward beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the clockwork quarter of Gearford opens only for a perfect tally of beacons. Weaver means to find out. 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: 667 326099576 297407474 72051 756789824 384494506 160293625 423193468 788558525 54463640 141329652 92540410 305252587 860413920 296860930 481453060 622121469 168985956 282440474 576126921 397294853 332797898 502769099 678729568 338799182 856169166 772617674 363182907 556720379 859325444 627733309 552817633 658403645 115236744 811317209 50565826 584155800 695014539 805594479 929500175 423581018 503740511 443517847 563002656 132201485 76826711 415337593 739168044 156167276 458835754 884826767 8450833 757758384 478644431 620932133 522343405 469678195 923769363 854546793 819326776 906344192 641453743 406568368 510716710 930598731 873101991 549816772 130864218 572436063 634181257 957179374 449761026 682002828 895072753 523453415 536258003 846902131 751207914 983237641 791923724 297432327 500284…
Output: 1 1 1 4 1 1 3 8 1 2 1 4 13 1 2 3 1 2 3 1 1 3 10 1 12 1 1 2 16 1 1 3 1 5 1 2 3 4 39 1 2 1 4 1 1 3 8 1 2 11 1 2 1 2 1 1 18 1 1 3 1 1 2 64 1 1 1 3 4 70 1 2 3 1 2 3 1 78 1 1 2 1 2 5 7 8 1 2 3 12 1 2 1 2 1 4 1 1 3 1 2 3 13 1 1 2 1 1 5 1 2 34 1 1 3 1 1 6 1 1 2 1 4 1 2 3 1 16 1 2 1 4 21 1 2 3 1 1 3 1 8 1 1 1 1 2 6 7 1 17 1 2 75 1 2 3 1 2 1 1 5 6 1 2 1 1 3 4 5 17 1 2 1 2 1 1 3 4 7 1 2 1 2 1 2 5 1 1 1 2 1 5 1 2 8 1 2 3 1 5 29 1 2 1 1 5 1 2 1 1 5 1 1 2 1 2 1 2 7 1 10 1 12 1 2 3 1 27 1 2 3 4 1 33 1 1 3 1 2 6 1 1 73 1 1 2 1 2 5 1 173 1 2 3 1 256 1 2 3 1 261 1 2 3 1 2 3 7 1 1 2 11 12 1 2 3 1 1 1 2 4 6 1 11 1 2 1 4 1 2 30 1 1 3 1 5 1 2 1 2 10 1 2 1 4 1 1 7 1 2 3 1 1 2 1 15 1 2 1 2 1 2 3 1 5 1 2 1 11 1 30 1 2 1 4 75 1 1 1 4 1 1 7 1 1 2 1 2 5 1 7 1 17 1 2 1 1 2 1 1 2 4 1 1 10 1 2 3 1 2 3 1 2 6 1 40 1 1 1 …

Example 2:

Input: 2191 382903525 5396700 843253525 199956107 389652185 167603617 661770141 908577399 353237829 408502877 654074990 246165456 438335042 152297396 607464860 602619862 292060474 2361859 621479807 438509667 834566990 7272705 3154881 580941772 7343272 242413092 58233647 844395466 142055377 568979199 785484931 735369585 789251170 287487445 408745526 925903812 999475307 200954796 925038392 496908974 420485506 965691162 772616611 454479755 607777532 864794217 682214865 546694729 400183881 20813519 204328582 21431723 470102689 218666146 582528182 904176395 62634087 802388687 217136282 254800975 532771009 741498817 967607867 983138408 612907965 371237762 389170023 188322611 116388269 876919632 582131407 911830991 244607343 875075340 795859892 416899667 523799287 15650172 376441593 762172670 963988361 …
Output: 1 1 3 1 2 1 4 8 1 2 3 1 2 1 4 1 1 1 8 1 13 1 1 3 1 2 1 20 1 2 3 1 5 1 2 36 37 1 2 1 1 5 1 1 2 4 1 1 1 1 2 1 5 1 8 14 1 2 1 2 3 4 26 27 1 1 2 1 1 6 1 8 1 2 1 1 2 1 2 5 17 1 2 3 1 2 3 1 5 1 7 1 1 1 3 1 2 14 1 2 1 2 3 1 1 1 3 1 2 46 1 1 3 1 2 1 1 2 1 10 1 1 13 1 2 3 1 5 6 1 1 1 1 5 1 26 1 101 1 2 1 2 1 1 2 1 2 3 4 1 1 2 3 11 1 2 1 4 1 2 1 1 1 3 27 1 2 1 2 5 1 1 1 4 1 1 7 1 9 1 1 17 1 2 1 2 1 1 3 6 1 54 1 2 1 2 1 2 7 1 1 10 1 1 1 4 15 1 17 1 1 1 4 5 1 2 8 1 10 1 1 185 1 1 1 1 5 1 2 1 1 3 11 1 1 2 4 5 1 1 8 1 2 3 1 2 1 26 1 1 1 1 2 6 7 1 1 1 1 5 1 40 1 2 1 4 1 1 3 1 2 6 1 2 3 1 2 1 4 1 2 1 8 1 2 1 25 1 27 1 1 3 1 2 1 2 1 2 1 2 5 1 1 15 16 17 1 2 1 1 2 1 7 1 1 2 28 1 57 1 1 3 1 1 6 1 1 3 10 1 2 1 2 5 1 7 1 1 10 1 2 23 1 2 3 27 1 1 1 4 1 1 1 3 1 2 1 7 1 9 1 12 1 1 1 4 1 2 1 1 3 22 1 1 2 3 1 1 117…

Example 3:

Input: 2052 417975816 205046825 993715815 767265531 839703987 346265182 450244076 275768779 952201617 645693962 97704500 547818718 98446144 770731695 762649580 587184273 849338490 722366259 134243559 738684559 85595471 473972235 940298955 21349443 427094046 667220748 495764035 208464532 183364365 905756295 428924403 269838564 710174043 494887301 902422388 756221752 488952300 336976708 641128825 5909287 107272455 764623650 20259238 959014313 604906428 372791210 419979297 291456609 502819509 305306511 806883047 808919615 636980134 371594972 549653853 539785742 726647222 710909730 611941166 790891034 573013721 429932933 890010182 900586588 913613605 938277227 241497837 932135762 189246128 303967362 930306513 306386366 19012937 119752124 564296398 362473551 696462514 457497265 904612151 843297452 689…
Output: 1 1 3 1 2 1 2 1 6 1 1 2 1 5 1 1 8 1 1 3 1 2 14 1 2 3 1 1 1 7 1 1 3 1 5 1 1 1 3 1 2 7 1 41 1 1 2 1 4 1 7 8 1 1 2 1 5 1 1 8 1 1 19 20 21 22 1 2 1 2 3 1 1 2 4 1 6 1 8 1 1 79 1 2 1 1 3 1 1 2 1 10 1 2 1 4 5 1 99 1 1 3 1 5 1 1 1 3 5 1 2 1 14 1 2 1 1 5 1 7 1 2 1 11 1 1 2 1 1 3 7 1 2 1 1 1 4 1 15 41 1 2 3 1 2 3 1 8 1 1 3 4 1 6 1 57 1 2 3 4 1 1 3 4 1 2 3 1 13 1 1 3 1 1 3 1 1 9 1 11 12 1 1 1 3 1 1 6 1 2 9 1 1 3 4 97 1 1 3 1 1 3 1 2 1 1 11 1 2 1 1 2 1 18 1 2 1 4 1 1 1 2 4 1 7 1 1 2 3 5 1 18 1 2 1 2 1 1 3 1 5 10 1 1 1 2 3 4 1 54 1 2 3 1 2 1 1 3 4 1 2 1 1 3 10 70 1 2 3 4 1 2 1 2 1 4 5 1 2 10 1 1 2 1 1 2 7 1 1 2 1 4 5 1 1 3 9 1 2 1 13 1 15 16 1 2 1 2 1 30 1 1 1 4 1 2 1 4 1 1 2 4 9 1 2 3 1 2 6 1 1 18 1 1 3 1 57 1 1 1 2 1 4 1 2 7 9 1 1 13 1 2 3 4 1 1 7 8 22 1 2 1 2 1 2 5 1 1 2 1 1 1 4 1 1 15 1 2 3 1 5 6 1…

Constraints:

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

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