CT48478

Yami's Streak Back Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the eel marshes of Slitherwick; Yami weighs the day's signals manifests and starts the calculations. 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: 302 543635 362587211 330185080 847353840 832100844 62251769 285639806 253317212 483571563 963054951 886012985 531827510 689818230 45802058 712654030 953160153 117758318 947600172 162110821 992018338 53046528 718988013 667407888 648269107 292812660 341813617 939717086 365808419 802997877 246528476 41165058 814619975 429813382 39679223 320491292 437845630 995682325 853309391 525698939 992266889 143494593 923262761 123033107 478387044 572133184 600784541 703091200 368483799 730060313 197534660 14816259 5512155 353551095 348675305 188527755 378640707 794517036 366898643 186682860 143234716 64100134 832381276 700667882 783851727 652453847 792347452 16382467 629334723 886904519 339944519 322793645 952255120 336871792 560235154 847140695 478743519 761092740 332109823 539860852 407901549 784202954…
Output: 1 2 1 4 1 1 2 1 4 10 1 1 2 1 4 6 1 2 1 20 1 2 1 1 1 2 7 1 2 1 1 5 1 1 2 4 37 1 1 3 1 2 1 2 3 4 5 1 7 1 1 1 4 1 1 7 15 1 1 1 1 20 1 2 1 4 1 2 27 1 1 32 1 2 3 1 2 1 2 1 6 10 1 84 1 1 2 3 5 1 7 1 2 1 4 1 13 1 1 3 1 2 1 1 3 22 1 2 3 1 1 2 1 5 1 10 1 2 35 1 2 3 1 1 3 1 5 44 1 2 1 2 3 1 7 1 2 3 1 2 1 4 5 1 2 3 19 1 2 1 1 2 6 1 2 1 1 3 6 1 2 1 1 1 1 4 8 1 1 17 1 25 1 2 3 1 1 6 1 2 3 1 5 1 1 1 9 1 2 1 2 1 1 5 1 2 1 20 1 2 1 1 3 1 5 1 29 1 2 1 2 5 1 2 1 2 3 1 2 1 4 5 11 1 2 1 4 1 1 3 1 20 1 1 28 1 2 3 4 1 1 3 1 1 2 11 1 2 1 2 5 1 2 3 9 1 2 1 1 1 1 3 17 1 2 3 1 1 6 7 1 1 3 4 1 13 1 2 107 1 2 3 1 2 1 4 1 9 1 2 1 292 1 1 1 1 4 1 1 2 8 10

Example 2:

Input: 3728 423480717 704500839 611894421 319086588 815024999 438239889 646204551 186946796 941027672 183255790 285176939 472214360 684534111 419366344 487840473 73518762 141567861 192394707 784899509 743927434 978963417 16864226 681704662 186848202 627162576 713738332 946491783 764470007 581284363 126397812 514357914 608251822 986737328 175398457 31065525 879292654 674669458 511802363 462655455 534394033 847527409 375567265 312488571 821799673 590720775 339553805 4875929 113219569 771492696 282283312 742011614 767192193 145076720 802397456 705617655 464307430 114545370 882741920 870396055 395947097 252839773 283978266 739052198 341601554 566718370 492529229 609601267 942079311 649747890 684188635 861260928 7049682 608263728 274466890 671486670 466847211 965899434 426128428 810063078 316523493 76…
Output: 1 2 1 1 5 1 2 1 9 1 2 3 4 1 2 1 2 3 10 1 21 1 2 1 2 5 6 1 1 1 2 4 33 1 1 3 1 1 1 3 5 1 1 3 1 1 1 2 5 1 2 3 1 10 1 1 1 25 1 1 1 2 4 1 2 1 4 35 1 2 3 1 2 1 4 1 44 1 2 1 2 1 1 1 8 1 2 11 1 1 3 1 60 1 2 1 4 1 2 1 2 1 10 1 1 3 1 2 6 1 78 1 2 1 2 1 1 7 1 1 3 1 2 1 4 1 1 3 18 1 1 1 2 5 1 2 1 1 1 1 3 1 2 6 7 10 11 1 2 14 15 1 2 1 4 20 1 1 2 1 2 33 1 2 1 1 56 1 1 2 1 2 3 4 1 1 3 1 2 1 2 3 1 10 1 2 1 155 1 1 3 1 1 3 4 1 9 1 1 3 1 1 1 7 1 2 1 11 1 2 3 1 1 6 1 19 1 21 1 1 1 4 1 1 3 29 1 2 1 1 5 6 1 2 3 4 1 12 13 240 1 2 1 1 3 1 2 3 4 1 1 10 1 1 1 14 1 1 3 1 5 22 1 2 3 1 5 1 2 8 1 1 2 12 1 1 1 1 5 6 1 1 3 1 2 6 1 1 2 1 4 12 1 2 1 1 5 1 1 2 1 1 1 7 1 2 27 1 2 36 1 1 1 1 4 1 1 3 1 2 1 2 49 1 1 64 1 1 1 90 1 2 1 1 2 1 7 1 2 10 11 1 2 3 1 5 6 1 2 1 4 1 1 1 2 1 6 7 1 2 3 1 2 1 2 5 1 1 3 1 10 1 1 1 4 1 6 1 2…

Example 3:

Input: 323 70567120 838229708 230434215 600254829 726933243 618943126 998149242 378541736 328263365 147537819 521796177 649594508 519911081 370083145 444286738 210730420 900333789 399281570 683698072 259329591 360674729 49666827 184160060 103959801 717632045 266474509 623354102 739023977 619511404 666703409 353034242 252778835 459129601 818666291 233779552 429965552 78141380 216256134 86028102 209110364 668777602 435727500 710699919 433962909 126707854 395552774 742581028 452759875 5531992 130071196 407810536 635893762 645946991 270120354 167946493 264758619 209354169 818287701 11485407 369884990 57549357 930579710 819554979 777028298 539674794 895171750 766830496 780950808 658213309 498682500 864632228 940307911 857539570 978183078 426967490 458252620 114068246 877220586 770738685 800270952 1453…
Output: 1 2 1 2 3 1 7 1 1 1 4 5 1 1 2 1 10 1 2 1 2 1 2 1 8 1 2 11 1 2 1 1 3 17 1 2 1 2 1 2 7 1 9 1 1 2 13 1 1 2 3 5 6 1 1 2 1 24 1 2 1 55 1 1 1 4 1 2 1 1 5 65 1 67 1 2 1 4 1 2 1 2 3 1 1 2 80 1 1 2 1 4 1 2 8 1 1 3 1 5 1 2 1 2 3 1 12 21 1 1 3 1 5 6 1 1 9 1 2 3 1 1 3 1 1 1 2 1 1 1 2 7 10 1 2 1 2 3 1 2 1 2 3 1 7 1 9 1 11 143 1 1 1 3 1 2 6 1 2 3 4 12 1 1 2 4 1 18 19 1 1 2 4 1 2 1 4 1 1 2 3 1 2 3 4 1 2 1 8 17 1 2 1 1 5 1 7 1 9 1 2 3 4 1 6 1 2 9 1 1 21 1 1 1 4 5 1 1 2 3 1 5 1 2 75 1 1 2 1 1 1 4 1 1 1 8 11 1 2 1 4 92 1 1 2 4 1 2 1 2 3 1 1 2 3 4 9 1 13 1 2 3 1 1 3 24 25 1 2 1 4 1 123 1 2 3 1 2 1 4 1 1 7 1 1 3 4 1 13 1 2 1 1 2 3 5 1 2 1 9 1 2 1 4 5 1 1 1 1 2 35 1 1 1 2 4 1 2 3 1 2 3 1

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Yami's Streak Back Ledger - MEDIUM Coding Problem | CodeTikki