CT55658

Last ledgers of Silas

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Silas inherited the exchange at the river town of Willowford along with its curious bookkeeping system for ledgers. Time to make sense of it. 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: 3039 626663008 802586537 556394256 85370321 895097620 397524622 2234794 318055303 302021089 136289332 833657293 821468154 989098818 520578834 197135930 193205112 406577361 493740788 126467557 110530784 806408108 815810787 988149630 440460744 429978211 175291697 877619195 643287943 549500070 78932821 410928846 411114796 320165659 363559622 293224635 383903664 13489283 648029003 251810959 236026828 234091699 430228683 383202673 500215105 371061399 292126672 313450790 202637770 243653390 783874656 783643557 488099235 262969960 718955916 776383960 59181147 758584346 891587133 614898628 939331229 797681958 48554010 555825767 953978716 888086987 586242279 767442481 725704206 207184745 607611706 804799543 572929469 372294650 536676096 136680923 119896196 290444071 717438032 946851370 74829280 515…
Output: 1 2 1 1 5 1 1 2 1 1 6 1 13 1 1 1 3 4 1 1 8 9 10 1 1 1 4 1 1 1 2 3 1 2 1 4 1 11 1 1 1 4 1 6 1 1 2 1 2 23 1 1 1 3 4 1 2 35 1 37 1 1 2 41 1 1 2 1 1 2 6 1 1 2 1 1 3 7 15 1 2 3 4 1 62 1 2 3 1 1 2 1 1 2 10 1 74 1 1 2 1 4 1 2 1 9 1 2 1 4 1 6 1 2 1 2 1 2 1 4 1 6 1 10 1 2 127 1 2 1 1 1 1 5 8 1 2 1 1 5 6 1 1 3 1 1 3 1 22 1 1 1 4 1 1 3 1 2 3 1 2 6 14 1 2 1 2 19 1 1 1 3 5 1 1 8 1 10 1 12 1 1 3 35 1 2 1 1 2 1 5 1 1 1 68 1 1 2 4 1 1 75 1 2 3 1 2 3 7 1 2 10 1 2 1 2 1 4 7 1 2 1 2 1 2 7 1 26 1 2 3 1 2 1 1 1 1 4 1 12 1 2 1 42 1 1 1 2 5 1 1 1 3 1 1 3 1 8 1 2 3 1 1 264 1 2 1 2 1 6 1 2 1 1 3 1 13 14 1 2 17 1 1 2 4 1 1 3 4 5 10 1 12 1 2 1 2 5 1 2 1 4 1 1 2 1 5 10 1 1 18 1 1 1 2 5 1 1 2 4 1 2 3 1 1 3 1 12 48 1 1 3 1 1 3 72 1 2 1 1 1 4 1 2 3 1 2 3 1 2 6 1 11 1 2 1 2 5 1 18 1 1 1 1 2 4 1 6 7 1 9 11 1 2 3 4 5 1 7 8…

Example 2:

Input: 1031 323907939 814136218 221255277 536486841 209468501 492193523 999836775 895670404 99991034 923066129 680310192 525594147 214969876 636761677 498615408 275018722 165487641 500241737 787357481 712299990 29455393 100054703 240366688 22182358 671700927 187198659 217536362 387786466 931200405 996471795 725225776 955720400 454746221 473053534 586303505 79976169 721706038 428847636 199767633 193847846 847214800 144708692 54469667 262139369 592747697 352348347 768010711 582768396 794848435 401928751 917874503 608908404 148086421 632257637 959722910 470120962 719580351 130352586 240715142 837613597 299517203 561395391 866471239 843767761 612878820 736515043 12280804 915408799 752975010 952233003 909836305 825207596 463452163 530697940 823839106 721501107 59521980 523276768 293668195 280591870 62…
Output: 1 2 1 2 1 2 7 1 1 3 1 1 1 3 1 1 1 4 9 1 1 2 3 1 5 1 2 3 22 23 1 2 1 2 3 1 5 1 1 1 9 1 1 3 4 1 6 1 8 1 19 1 1 3 25 1 2 1 2 5 1 2 8 1 1 2 1 13 1 15 1 1 1 2 3 1 1 2 1 1 5 1 1 54 1 1 2 4 1 1 1 2 5 6 1 2 9 1 1 3 1 5 1 7 17 1 1 2 4 1 2 7 1 30 1 1 3 1 1 6 37 1 1 3 1 2 6 1 8 1 2 3 1 2 1 2 5 1 1 2 1 2 3 15 1 2 1 1 3 6 1 2 1 4 1 12 1 2 1 2 17 1 1 2 1 2 1 6 8 1 1 3 1 5 1 32 1 2 1 4 1 1 3 4 1 42 1 2 1 2 1 2 5 6 1 1 1 12 1 2 1 2 17 1 1 2 4 22 1 2 1 2 1 2 1 6 7 1 1 2 1 1 13 1 17 1 2 1 1 109 1 2 1 2 1 6 1 2 1 2 1 12 1 1 3 4 1 6 1 1 3 1 1 2 1 4 1 2 1 1 5 1 1 16 1 2 3 1 21 1 23 1 1 3 1 28 1 1 3 1 2 6 1 1 2 1 4 1 1 1 1 5 1 11 1 2 1 4 1 6 1 2 9 1 1 3 1 2 3 16 1 1 192 1 2 1 1 1 6 1 2 1 1 3 4 1 6 7 1 2 1 4 14 1 1 1 4 1 2 1 2 29 1 2 1 1 1 4 5 6 9 1 2 3 4 1 6 1 2 3 1 2 12 1 1 2 1 5 1 2 1 1 2 6 1 1 2 1 1 6 1 31 1…

Example 3:

Input: 2539 925840378 912691001 928084725 727838875 627309138 357455575 158446418 621245327 677353014 208705686 264942445 128503869 926961716 263095666 581752819 886552387 212073754 551341413 299549063 966515490 83433619 382947393 522999917 710660523 217354601 898389075 444675871 702190943 508724821 302071998 241886101 372956298 914877860 740838411 999616849 665506034 25048320 669776372 281238165 985649212 399652100 521515972 763271564 748192117 508891073 261874971 915618578 782049957 120767036 577267960 580958054 658329182 673230229 487745618 418818511 138071979 857633979 900260720 368764589 159990911 907896393 912383682 621970094 211011318 640599641 6716941 336386995 76243378 145987951 769376302 652956901 67287384 419001911 622880532 21996809 654300430 210924781 85922481 977944046 95361650 2642…
Output: 1 1 3 1 1 1 1 3 5 1 2 1 10 1 2 3 1 2 1 20 1 2 3 4 1 6 1 2 1 1 1 3 13 1 35 1 1 3 1 5 1 2 3 1 1 1 7 1 1 2 3 4 5 1 1 1 10 11 1 1 14 15 1 1 3 1 2 1 2 8 1 1 2 3 1 6 1 1 39 1 2 3 1 1 1 3 1 9 1 1 3 4 1 1 3 1 5 1 1 2 1 2 1 2 1 27 1 2 1 2 5 1 1 8 9 1 2 1 2 1 6 1 1 2 3 11 1 1 2 15 1 1 3 28 1 1 2 1 60 1 1 2 1 1 6 1 1 2 1 2 3 1 7 1 1 1 12 1 2 1 2 3 6 1 26 1 1 3 1 2 1 2 1 1 1 4 1 1 1 2 11 1 1 3 20 1 2 1 24 1 1 1 1 1 6 1 1 2 4 1 1 2 124 1 2 1 2 1 2 1 4 1 1 1 8 1 2 1 4 1 2 15 1 1 3 1 1 2 1 8 1 29 1 2 1 1 3 4 1 8 1 1 3 1 2 1 1 8 1 18 1 2 21 1 2 1 217 1 2 1 4 1 2 1 8 1 2 1 4 1 2 1 2 1 1 1 4 5 1 1 1 3 18 1 1 3 30 1 1 1 1 4 6 7 1 2 3 1 2 3 1 1 3 4 1 1 1 3 5 1 2 1 1 5 1 2 23 24 1 2 3 4 1 30 1 1 2 3 5 1 7 1 1 1 3 5 1 7 1 1 2 1 2 6 1 1 2 1 2 1 4 1 1 3 1 18 1 2 21 1 2 68 1 2 71 72 1 1 1 1 4 5 1 1 1 2 5 1 2 1 4 5…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Last ledgers of Silas - MEDIUM Coding Problem | CodeTikki