CT49492

Farhan's Ember Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

At the singing sands of Echo Dunes, Farhan records each marks in a worn leather ledger. The guild wants answers, not guesses. 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: 3217 955905677 114212123 856794841 572427985 664376193 537768667 195141635 314817796 401897378 974906900 715183468 73741575 114875441 185052205 170283833 94709513 820630454 244429380 566917902 369048331 928962191 845485223 150443359 674908235 483335516 519033078 825291173 4656495 291162422 452166728 20170114 12299395 678385863 585035598 708818805 687445845 259348646 871887991 230626767 802614216 739106833 612733867 293727679 82087907 58600955 111836894 691911006 500907266 893389991 214159093 866676863 450013656 45475192 145374451 423188601 647452439 421568086 219307038 441094873 979071863 848013604 71265 387571449 638829293 772436819 961123278 896147762 727824142 739622002 482904646 988835031 878362046 909001726 567437698 242355122 270831006 260465766 239061762 461903401 410566108 56168225…
Output: 1 1 2 1 2 1 1 2 3 10 1 1 2 3 1 1 7 1 2 1 11 1 1 2 1 2 5 1 2 3 1 1 6 1 8 1 1 17 1 2 1 1 1 1 1 3 6 1 28 1 2 1 1 2 3 5 1 1 3 60 1 1 2 3 4 6 1 1 2 1 71 1 2 1 1 2 1 1 5 1 7 1 2 3 1 13 14 1 18 1 2 1 2 3 1 5 1 2 10 1 2 3 4 1 1 7 1 1 1 110 1 2 3 1 2 6 1 1 2 3 5 1 2 1 4 1 11 1 1 1 2 1 2 24 1 26 1 1 2 4 1 2 1 1 5 1 11 1 1 3 4 5 1 2 8 9 1 2 3 24 1 2 3 1 2 6 1 2 1 1 2 6 1 1 3 1 2 1 2 8 1 2 3 1 2 6 7 1 2 3 31 1 1 1 1 1 2 5 1 8 1 1 2 1 1 3 15 1 1 2 51 1 1 3 1 1 6 1 2 9 1 2 1 2 1 4 1 1 3 1 11 1 1 1 3 1 2 27 1 1 2 1 1 1 1 5 1 10 1 1 13 14 15 1 1 1 1 4 5 1 151 1 1 3 4 5 1 1 2 3 4 6 1 1 9 166 1 1 1 170 1 1 1 1 3 1 2 8 9 1 2 3 4 1 1 7 1 1 1 20 1 2 1 2 5 1 2 28 1 1 3 1 2 1 2 8 1 1 1 3 4 1 1 2 4 18 1 2 3 4 5 1 2 8 1 2 3 1 2 1 61 1 2 1 4 1 2 3 4 1 6 1 1 1 10 11 16 1 1 3 1 2 22 1 2 1 2 1 1 1 4 1 8 33 1 1 2 1 1 2…

Example 2:

Input: 30 742813599 715836303 360099916 535786505 262652096 56994876 482638476 175695895 65521255 177744414 945443741 34952809 543648309 938480207 916949350 518876994 378915404 74320511 487565814 843229964 679804025 868239846 67422765 266955686 365147680 710999358 362113313 86733796 72144387 777122477
Output: 1 1 1 2 1 1 3 1 1 3 11 1 2 3 1 1 1 1 3 5 1 7 1 2 3 4 1 1 1 8

Example 3:

Input: 1075 429431958 68819223 878845661 491409136 139409269 743528631 370652401 942237070 359769540 529319853 936824937 824966587 841381282 965203073 431182255 259134831 393504224 346989198 754753822 17432216 880224152 349795232 292345835 123868362 494662725 715910632 733600477 541238950 378561954 256823170 593058144 742264899 369093725 528173337 155215459 922256857 351888611 442034421 56050888 84617399 134297250 400006717 740594102 510345921 496650096 952365244 560630331 741750368 511305917 437476872 171371947 307252212 397643530 800929508 859843539 328085636 902300844 375259482 538878439 667810700 308866921 143775226 187331825 515261756 908196765 307786525 696742749 104966734 91776074 875245669 384832873 513446567 821541316 404497856 368065121 303927846 986827859 373165539 592449551 437055603 …
Output: 1 1 3 1 1 3 1 8 1 2 3 1 2 14 1 1 2 1 5 1 7 1 1 1 4 5 6 1 1 1 4 11 1 2 1 22 1 2 1 2 3 4 7 1 1 32 1 2 1 1 1 2 3 8 9 1 11 1 2 3 1 1 2 4 19 1 2 1 1 5 1 2 3 1 1 1 77 1 2 1 4 1 6 1 2 1 4 1 6 1 1 2 93 1 2 1 2 3 6 7 1 1 3 11 1 2 3 1 1 1 1 3 6 7 1 23 1 1 3 4 1 2 3 8 1 2 3 1 5 1 1 16 1 2 3 1 1 2 23 1 1 3 1 2 1 2 8 32 1 2 1 2 1 2 1 8 1 1 2 67 1 1 3 1 1 2 3 5 1 1 1 1 10 1 2 3 4 1 16 1 1 1 3 1 2 3 1 1 2 1 2 3 10 1 2 1 4 1 6 1 2 3 1 2 1 13 27 1 1 1 32 1 2 3 1 2 1 1 5 1 7 1 1 3 1 5 6 1 50 1 1 1 2 1 4 1 1 2 8 1 1 2 83 1 1 3 1 2 1 4 1 2 7 8 1 2 1 4 16 17 1 1 2 1 2 1 1 5 1 9 1 1 3 1 5 1 1 18 1 1 2 3 1 41 1 2 1 2 5 1 2 1 1 5 11 1 2 3 1 2 1 1 19 1 1 3 1 2 1 26 1 2 3 1 2 32 1 2 3 1 2 1 2 324 1 1 1 2 4 1 1 1 4 10 1 2 1 2 3 16 1 1 2 1 5 1 1 2 4 10 1 2 1 1 1 2 1 8 1 2 3 1 1 2 3 4 9 28 1 2 1 4 5 6 51 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.