CT40367

Ulric's ledgers Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the eel marshes of Slitherwick opens only for a perfect tally of ledgers. Ulric 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: 2160 91251018 49478056 282981693 941060791 263546638 862390754 253385269 621562123 994131364 106333209 668869244 43074645 160581092 978606139 970880478 961791650 990689508 243119123 63044061 249092633 389753059 581975043 692336610 589351140 309470918 438678897 15804333 704324204 700666115 705607648 631959185 149406474 274579471 805094106 561848133 819703586 750525480 632520563 871091893 956522562 338081549 628236235 935077608 298877358 501554719 715648624 199090838 781236156 73251830 139735940 499571223 639891164 586465607 831246700 949252232 647577056 300660764 191562275 71888093 652144884 619538433 780512201 240898301 728014231 596836603 684409230 291802297 223789860 934322840 608003752 218609856 148880606 786788521 887941613 958725008 608880835 472740613 186353136 185521091 509407108 69…
Output: 1 1 3 4 1 2 1 2 9 1 2 1 2 5 1 1 8 1 1 3 4 5 6 1 1 2 1 11 1 13 1 1 2 17 1 19 1 1 22 23 1 2 3 1 2 3 1 5 1 2 3 4 1 11 15 1 1 1 1 5 1 7 1 2 1 2 1 1 14 1 1 1 4 5 58 1 1 1 1 4 6 65 1 1 1 69 1 1 2 3 1 2 7 1 95 1 2 3 1 2 3 1 1 2 1 2 1 4 5 1 2 1 4 13 1 1 3 20 1 25 1 1 1 3 4 1 1 3 8 9 1 1 3 1 14 1 2 3 1 1 46 1 2 1 4 1 2 1 1 1 6 1 1 2 1 1 1 7 1 1 1 3 1 2 1 4 9 17 1 2 3 1 1 1 2 1 4 6 1 35 1 2 38 1 1 3 92 1 2 1 1 5 6 1 2 1 1 11 1 1 14 1 2 1 1 2 4 7 8 1 1 2 3 5 28 1 1 1 2 1 2 127 1 2 3 1 2 3 7 1 2 1 1 2 3 4 6 1 1 1 12 1 1 2 1 5 1 7 1 2 3 4 5 1 2 1 16 29 1 1 3 4 1 2 1 1 5 1 2 3 1 2 11 1 2 1 4 5 1 2 52 1 1 2 1 4 1 6 8 1 62 1 1 1 2 3 1 1 3 7 1 9 11 13 14 1 1 3 1 1 89 1 2 1 2 3 4 1 1 1 3 11 1 2 1 1 3 1 2 1 2 1 2 5 1 9 1 11 1 2 1 4 1 1 3 24 1 1 3 1 1 3 4 5 1 7 8 9 1 1 1 4 5 1 54 1 2 1 2 1 4 1 2 3 4 1 6 1 2 3…

Example 2:

Input: 3552 187002486 339390896 391302895 355632087 99874596 334815532 734559212 856497243 818086848 214643567 467896302 143857454 848963834 641201995 885772387 327938829 920294019 858160330 403557206 242303709 67297443 200295368 13030504 590909018 318272601 493163002 61037459 116803803 188679754 611562904 956066008 960825947 111643944 269086298 277551300 228679628 412325435 938180019 267161513 666911472 263261950 910112059 30590174 253805842 72446018 89295676 898357038 510503320 608318525 12805978 666015029 732712358 893106563 681583259 941067801 170135895 982524483 793218470 143218224 354895367 549987354 371999871 999163235 230395215 992449482 766058593 395399175 24168216 53668832 123522525 13941195 886673400 558512628 326566488 818064024 731991151 313320160 860469453 645906258 102987298 439846…
Output: 1 2 3 1 1 2 7 8 1 1 2 1 5 1 15 1 17 1 1 1 1 2 1 6 1 2 1 2 3 12 31 32 1 2 3 1 5 6 1 2 1 4 1 2 1 2 5 1 2 1 4 5 6 1 23 1 57 1 1 2 3 1 63 1 2 1 1 1 2 3 1 7 1 1 3 1 1 6 1 1 1 17 1 1 1 4 1 2 1 8 1 1 3 1 30 1 2 1 4 35 1 2 3 1 1 3 7 1 2 10 46 1 1 3 4 1 6 1 2 1 1 5 12 1 1 2 1 5 1 1 3 67 1 2 1 4 1 2 76 1 2 1 4 1 1 7 8 1 2 1 2 3 1 15 1 1 3 4 1 2 1 2 3 4 1 2 13 1 1 3 1 5 1 1 1 2 1 4 5 1 9 1 2 3 1 5 1 2 3 4 5 1 21 1 2 1 4 5 1 7 1 1 2 4 5 1 1 1 4 5 1 2 3 1 5 1 17 1 2 1 2 3 4 1 1 2 1 5 1 11 14 1 1 1 2 4 6 1 1 3 1 2 6 1 78 1 1 2 3 1 2 1 7 1 101 1 1 104 1 1 2 1 4 1 1 3 8 9 1 2 1 1 5 16 1 2 1 4 5 6 1 1 1 3 1 1 1 1 4 1 11 1 35 1 37 1 2 3 1 1 2 1 2 1 7 1 2 3 1 5 1 17 1 1 3 1 1 3 4 1 6 1 1 1 10 14 1 2 1 4 1 1 2 1 1 182 1 1 3 1 5 1 1 3 1 2 3 1 8 14 1 2 1 1 3 1 2 1 1 1 3 1 27 1 2 3 1 1 6 1 2 1 4 1 221 1 1 1 2 5 …

Example 3:

Input: 2575 884966199 996643501 569098389 97688077 842367530 221903391 130931324 775872228 851837657 888671849 696388331 361270939 760012754 627156140 769498135 108259240 981189575 157494130 896334422 884354807 620270355 685287579 324911064 489821935 688540202 294898849 239347512 315366652 540456149 373438812 972887428 520303597 151379697 453539845 105965301 868139050 605316222 788352083 143925526 753970446 763070502 674175452 739938083 611218045 679632696 943355086 467182937 293781599 256226113 130884062 58784805 734764710 837207414 501532734 629577062 860595891 95079848 537303984 935743143 368927628 717953566 176736510 63120096 86641162 270367398 886050167 487676961 374633310 733500026 20614033 121271533 103281487 13731998 620128499 322813803 776272784 438640123 496584596 710296290 610420231 33…
Output: 1 2 1 1 3 1 1 3 7 8 1 1 3 1 5 1 15 1 2 1 1 2 1 2 5 1 1 3 4 1 14 1 1 2 1 5 1 2 1 2 3 1 2 1 2 15 1 1 1 1 1 6 7 1 2 10 1 2 13 1 2 1 1 2 4 7 1 1 3 1 2 1 1 5 1 10 1 2 3 1 1 51 1 2 1 2 1 2 1 6 1 2 1 2 3 6 1 1 1 16 1 18 1 2 1 2 3 1 1 3 7 1 2 1 31 1 1 3 4 1 6 1 2 9 10 1 1 3 4 15 1 1 1 2 1 5 1 2 3 25 1 1 28 1 1 1 4 5 1 2 134 1 2 3 1 1 2 1 5 9 1 2 1 4 1 1 7 17 1 19 1 2 1 4 1 1 1 3 1 1 11 1 1 3 1 2 1 1 3 6 10 1 2 1 1 5 1 2 3 1 20 1 2 1 35 1 2 206 1 1 1 3 1 6 1 1 1 3 5 1 2 1 1 5 1 7 1 2 1 11 1 1 14 1 1 2 4 1 2 1 4 1 1 11 1 2 1 2 1 31 1 1 2 1 2 5 1 8 9 1 1 2 1 264 1 2 1 1 3 1 1 1 9 1 2 1 1 3 1 2 3 1 8 1 21 1 23 1 1 2 3 5 1 2 1 2 3 34 1 36 1 2 1 1 2 1 5 1 1 3 1 1 2 4 1 9 1 2 1 1 2 4 7 8 1 1 11 1 1 3 1 2 6 1 1 9 10 1 2 1 2 5 1 1 2 1 10 1 2 43 1 1 2 4 1 1 1 1 9 1 2 3 4 1 15 16 67 1 1 70 1 1 3 1 1 3 7 1 1 …

Constraints:

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

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