CT42455

Keeper and the Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Keeper found an old ledger of ledgers in the archive attic at the beacon hill of Lantern Tor. The margin notes pose a precise question. 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: 1908 702825627 347364713 279428095 329811176 575408137 927122925 779732125 87612887 560037030 864962642 771943787 716979051 290534278 150004565 379707555 998823294 720182746 673084881 787307169 577784731 41966266 654247905 460274586 36139980 225979376 961719806 542169380 606216564 594017581 493530863 248560327 381451405 297019766 942172312 72675359 581029327 24399695 726673936 414243830 164131411 368822199 781848322 935354872 81481731 341898582 308876204 678616067 542941384 995145215 72451084 24694095 617826219 261816953 572145856 965264450 346016778 627152384 337810896 941429565 890902378 726296968 23868399 969116425 931342131 91946004 107617031 853959421 339263548 152129348 959102974 818758214 305184430 207191511 680906388 598379423 181011955 898356331 804906835 870350327 896895048 98338…
Output: 1 1 1 2 4 6 1 1 2 4 1 1 1 1 3 16 1 1 3 1 1 3 1 1 2 10 1 2 1 1 1 2 1 8 1 2 1 4 1 1 2 8 9 1 2 1 4 1 33 1 1 3 1 2 6 1 2 1 4 1 1 1 14 1 1 2 3 1 1 7 1 1 1 3 1 1 7 1 2 3 32 1 34 1 1 2 4 5 1 1 2 1 1 3 6 8 1 1 3 1 1 6 1 2 9 10 1 25 1 1 1 2 1 1 1 3 1 9 1 2 1 13 1 2 1 1 3 1 7 1 2 10 1 1 2 1 28 1 1 3 4 5 1 7 1 2 1 11 1 2 3 1 2 1 4 1 2 1 50 1 2 1 2 1 2 1 4 1 10 1 2 89 1 2 1 4 1 6 1 2 3 1 1 1 2 1 9 1 11 1 1 2 1 5 6 1 1 1 4 1 6 1 14 1 1 1 4 1 2 1 1 3 1 2 12 1 2 1 4 17 1 2 223 1 1 1 2 1 4 1 2 3 1 1 1 1 5 1 10 1 1 1 4 1 2 1 18 1 24 1 1 3 1 2 32 33 1 1 3 1 1 1 2 8 1 1 1 1 4 1 2 3 1 2 1 4 1 14 23 1 1 2 1 1 3 4 1 2 1 8 1 36 1 2 1 1 74 1 1 3 1 2 1 1 8 1 10 1 12 1 2 1 2 5 1 1 1 4 22 1 2 1 2 1 1 3 6 1 2 1 4 1 2 3 1 1 40 1 2 3 44 1 1 1 4 1 1 2 3 5 54 1 2 1 1 3 1 1 2 1 1 3 4 1 2 10 14 1 2 1 2 1 4 5 1 2 1 2 1 4 1 …

Example 2:

Input: 3798 278218357 516523735 568194980 56194154 59045072 408988574 299166673 539989939 313159645 453628875 942580559 397299737 498184366 849461111 207437540 163117042 759424300 856695587 852945237 523206942 507472293 699799440 558643734 858168541 64077356 964939216 887304736 921946093 658787904 979314568 956449710 479610446 735824548 643124098 857878847 32817949 246490125 516380502 940584033 587008085 659205365 429101727 833407946 699671902 628813826 309572098 991193794 707146640 815374131 557656923 764271057 700138537 982847957 931677791 241605159 704899458 559044702 870378273 500574482 125529635 96188748 638160937 598105779 125986774 976584410 782884309 213371836 928797619 750337039 620727342 748500615 275386537 854156015 327457637 868339767 959377564 270964755 625452101 162550408 214331884 …
Output: 1 2 3 1 2 3 1 5 1 2 11 1 2 3 1 1 3 7 1 1 1 3 1 13 1 26 1 2 1 30 1 1 2 1 4 1 2 3 8 1 2 1 4 1 1 1 47 1 2 1 2 1 6 1 1 2 1 4 1 1 1 4 1 1 12 1 1 3 1 1 2 1 5 1 7 11 1 2 1 2 1 4 5 8 1 1 34 1 1 1 4 1 1 1 4 5 1 2 1 1 10 1 1 3 1 1 2 3 4 6 1 112 1 1 2 1 4 1 2 8 1 2 1 2 5 1 2 1 17 1 1 2 1 22 1 2 1 1 2 3 7 8 1 1 3 1 35 1 2 3 1 2 41 1 1 1 2 5 1 1 2 3 1 2 1 166 1 2 3 1 1 3 1 1 1 7 1 2 10 11 1 2 1 15 1 1 3 1 20 1 1 1 1 2 3 1 1 32 1 1 2 3 4 5 6 8 1 1 2 1 2 1 1 2 8 18 1 1 1 54 1 1 3 4 1 1 7 1 1 1 2 3 4 6 1 9 1 2 1 1 2 6 1 1 1 1 4 1 29 1 2 1 1 2 6 7 1 1 3 94 1 2 3 1 2 1 4 5 1 1 1 9 1 1 1 4 1 2 1 4 1 2 1 12 1 1 3 16 1 1 31 1 1 3 1 2 6 1 1 9 1 2 1 2 5 1 2 17 1 2 3 4 5 1 7 1 26 1 1 3 1 2 3 1 5 1 7 8 1 1 11 1 1 1 4 5 1 2 79 1 1 1 3 5 1 1 2 1 10 1 1 13 1 2 3 1 1 3 1 1 1 4 8 9 1 1 2 3 4 6 1 8 1 2 23 1 117 1 2 1 1 …

Example 3:

Input: 2054 72873363 789604063 431827144 157147544 946043015 281252301 329797038 535468788 49250188 54218186 928871972 813217486 995235808 562326044 787764336 820993261 319494060 385532861 127856144 8785250 839396101 446672092 548766729 532348838 650978612 241964166 889843033 170073128 419555266 790283109 633221045 835496378 652823649 85092047 719329464 560876939 423924725 245844946 571857541 397030217 239510346 893125710 373990425 673500901 942815376 296258315 992361402 283440348 676549875 443087994 92318908 288958846 240550902 224268425 847995114 334102195 992957368 409870572 185098024 952674486 395506961 437517584 778660826 425429164 402115854 329367053 735701285 516171553 595079046 48089772 163956051 547233888 196760210 116796291 289285008 709651040 151146894 362775586 175570965 901221564 412…
Output: 1 2 1 1 5 1 2 3 1 2 6 1 13 1 2 3 1 2 1 1 8 1 2 1 4 1 14 1 2 3 1 5 1 1 3 1 1 1 4 1 1 29 1 2 32 1 34 1 2 1 1 2 1 1 8 1 44 1 1 3 1 2 3 1 1 1 4 1 2 1 2 3 1 1 3 9 1 2 1 20 1 25 1 2 1 2 5 1 7 8 1 10 1 1 13 1 2 1 2 1 1 7 1 2 1 1 3 51 1 2 1 2 1 2 3 4 1 10 1 1 64 1 1 1 3 1 5 1 7 1 1 2 4 12 1 1 1 4 1 2 1 8 1 1 2 1 4 1 2 29 138 1 1 1 3 5 1 1 1 3 5 1 1 1 9 1 2 3 1 1 6 1 2 1 4 20 1 2 1 1 5 6 1 1 3 1 2 1 33 1 1 1 4 1 1 1 4 1 2 1 8 1 2 1 4 1 18 1 1 1 2 5 6 25 1 1 1 62 1 1 2 1 5 6 1 1 1 4 11 74 1 2 1 2 3 1 1 6 1 2 1 2 1 2 5 1 15 18 1 1 21 1 2 1 1 1 4 1 1 3 261 1 1 2 1 5 1 1 1 3 5 1 1 8 1 1 3 1 2 6 7 1 1 2 11 1 2 1 4 1 2 31 1 2 1 1 3 1 1 1 9 1 11 1 1 2 1 5 1 2 3 1 1 1 1 8 1 2 11 1 2 1 4 1 2 1 19 1 2 1 1 5 1 1 2 4 1 1 3 1 2 10 1 17 1 2 3 1 2 6 7 44 50 1 1 3 1 2 56 1 1 1 4 5 1 2 1 9 10 1 1 3 1 1 6 1 1 1 1 3 …

Constraints:

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

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