CT40777

Faye's Ledger of ledgers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the cinnabar mines of Vermilion opens only for a perfect tally of ledgers. Faye 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: 1833 435247132 991075692 169022599 261933716 892470541 207446318 448106968 522300585 247899193 780254400 473518552 695243986 18188756 112375856 210621485 807990767 352889618 945777402 519653305 474062160 420868761 604337080 97865373 571820727 675648161 151905658 136783570 335267431 880697203 873198429 707180161 672688983 769246228 918406143 424589645 209163672 229186138 692850790 75906977 555408591 206601152 866997681 76793570 24022102 880234893 725405231 396337974 606150957 782988391 459434657 442746312 66125341 650591217 217240142 329361144 129207906 859093509 192520300 582179903 623883612 997003067 823133024 419607441 590716730 221694483 362300796 841115943 112586452 847842672 291010454 264700702 34441267 528188143 640422325 55640682 228861842 727690630 539707826 832687185 21674202 6827…
Output: 1 2 1 2 3 1 2 3 1 5 1 2 1 2 3 11 1 16 1 1 1 4 1 2 7 1 1 3 11 1 1 1 3 16 1 1 2 4 1 2 1 8 1 1 11 1 1 2 4 1 1 1 4 1 2 1 12 1 2 3 61 1 1 2 1 2 6 1 8 1 1 1 4 5 1 2 8 1 10 1 2 1 2 3 1 1 18 1 1 3 4 1 2 7 1 35 1 2 1 1 2 4 5 1 9 1 2 1 1 2 6 16 1 53 1 2 1 1 1 2 7 61 1 2 1 65 1 2 1 1 1 4 1 2 1 2 1 1 3 6 1 14 1 1 1 2 4 1 7 1 90 1 2 1 2 3 1 2 8 1 1 1 2 1 2 7 16 1 1 1 4 1 1 1 8 1 1 3 1 5 120 1 2 1 4 5 1 2 8 1 2 1 4 1 1 3 16 1 1 2 1 2 3 6 24 1 1 3 4 1 2 7 1 153 1 2 1 2 1 2 3 1 5 1 1 1 2 228 1 2 1 4 1 2 1 2 3 1 1 3 1 8 1 1 3 1 2 6 1 1 1 24 1 26 1 1 3 1 31 32 1 1 2 4 1 2 1 2 5 1 1 1 45 1 1 2 3 1 1 6 8 1 2 1 2 1 4 1 61 1 1 3 4 1 2 1 1 3 71 1 1 3 4 5 1 7 1 2 1 4 12 1 2 1 2 1 6 1 1 3 1 2 6 1 1 15 1 1 30 1 2 33 1 1 1 2 1 1 7 1 2 1 2 1 6 1 1 1 10 1 2 3 21 1 2 1 2 59 1 1 1 1 5 1 2 138 1 1 3 4 1 1 3 4 1 1 11 1 1 …

Example 2:

Input: 3082 728156738 720410529 994747490 814587331 172637390 466917304 455478974 68279294 255511884 881176356 780557685 147834295 338884134 861216747 513134953 444056933 203570030 132678720 747734899 179749840 655741069 554175063 194799954 566594320 685791950 8997318 449156144 109089425 239337797 32710812 379347906 69034780 530966502 264350088 506434482 81349383 634430416 607824423 149044203 188247850 942369337 888255731 158174195 109274157 66308544 526147437 247596600 184349986 343011031 505405336 549602073 390093706 224623218 44016129 695196657 183376812 332404336 423096492 546073382 734047827 335282935 51095688 483978086 588854351 809129122 759301019 332402677 816702830 542398062 592469383 241998082 933484518 216893566 340644289 675216752 529337868 347300119 186980233 787918335 62402080 39770…
Output: 1 1 3 1 1 2 1 1 2 7 1 1 2 4 1 1 1 1 5 1 2 1 1 3 6 1 2 1 2 1 4 1 8 1 2 1 12 1 1 2 38 1 1 1 1 4 1 1 3 4 9 1 1 1 13 1 2 3 4 18 1 1 3 4 23 1 1 26 1 2 1 31 1 2 3 1 1 1 7 1 2 1 11 1 1 1 3 16 1 2 3 1 1 1 1 1 3 1 2 3 1 5 100 1 2 1 2 3 1 110 1 2 1 2 1 1 7 1 1 3 1 5 1 2 3 4 17 1 2 1 2 1 6 1 1 1 1 2 5 13 1 2 1 2 3 6 20 1 2 1 4 1 2 1 2 3 1 2 1 2 1 1 2 11 1 2 1 1 5 17 1 2 20 1 1 3 1 2 26 53 1 2 1 1 1 3 1 6 1 1 3 10 1 1 1 4 1 1 7 20 21 22 1 2 1 1 5 1 7 1 2 3 86 1 2 3 1 2 3 4 5 1 7 1 1 1 4 1 13 1 15 1 2 21 1 1 1 1 129 1 1 2 4 1 1 2 1 5 1 1 2 4 1 2 1 4 1 2 1 4 1 14 1 25 1 2 1 4 1 1 1 8 1 2 1 1 13 14 1 2 1 4 44 1 2 1 2 1 2 1 6 1 2 3 1 2 1 2 3 9 1 11 1 13 1 2 1 2 1 6 7 1 22 1 2 1 2 3 1 1 6 1 1 2 12 13 1 1 2 4 1 49 1 1 2 1 1 6 1 2 3 4 1 2 1 2 5 1 11 12 1 2 1 1 2 6 1 1 1 3 1 1 1 3 8 1 11 1 2 32 1 1 1 3 1 1 2 …

Example 3:

Input: 3149 245282152 981229438 592624932 383455964 5129021 925234029 148085785 560900882 156369009 449158566 104653161 196724587 967796176 961211218 799248451 899790701 684022410 170978550 719682073 991464708 297252957 611544204 698202060 809078711 927811030 926491678 118788200 192323156 303300334 317166478 479473857 982059704 873387848 200217287 925890044 95505680 875719378 425873091 104344952 713485464 891207356 927874687 945817031 698108314 891118614 11890718 390127239 750085940 309968586 196258701 991513270 490082915 444122314 684621498 930262181 693969502 906072261 399182272 668933243 20159564 482300088 561276008 527457149 256015087 470416456 958948969 132064621 723089334 957817370 789880204 323697739 125531413 85414104 506027366 235856395 634586075 434872084 342266802 449885176 142211409 4…
Output: 1 2 1 1 1 4 1 2 1 2 1 2 11 1 1 2 1 1 3 20 1 2 3 4 5 1 1 2 3 4 5 12 1 1 3 1 2 1 1 3 6 10 11 1 2 1 2 3 1 1 51 1 1 3 4 1 2 1 2 1 2 3 1 1 2 15 1 2 3 1 1 1 1 4 1 6 1 1 3 1 2 6 13 1 2 1 2 19 1 2 1 4 42 1 1 3 1 2 1 2 5 1 2 1 4 10 1 1 3 14 1 2 1 4 1 1 1 4 1 1 2 3 5 10 1 1 1 2 4 37 1 1 1 1 1 43 1 1 2 4 1 2 1 8 1 2 3 12 1 150 1 1 3 1 1 2 1 5 6 1 2 1 1 5 12 1 17 1 19 1 1 1 4 1 6 1 2 1 29 1 1 2 1 2 1 2 3 9 1 2 3 1 5 1 2 17 1 1 3 1 2 1 1 5 1 1 2 4 1 1 3 1 17 1 1 1 2 1 6 1 2 1 2 1 4 7 1 2 1 1 1 13 1 2 1 17 1 25 1 1 28 1 1 1 4 1 1 7 1 2 1 2 12 1 2 1 2 1 2 3 1 9 1 23 1 2 3 1 1 2 7 1 1 95 1 1 3 4 1 6 1 1 3 1 1 6 1 1 3 1 2 3 13 1 1 3 4 1 6 1 1 3 1 2 3 1 2 9 10 1 2 1 1 1 22 1 2 3 1 1 1 2 5 1 2 1 9 1 2 3 1 2 1 1 1 6 1 23 1 1 26 1 1 1 2 5 1 2 1 1 1 4 1 2 81 1 1 3 4 1 2 3 4 9 1 1 1 2 5 1 1 2 9 1 1 2 1 2 1 4 1 2…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Faye's Ledger of ledgers - MEDIUM Coding Problem | CodeTikki