CT45396

Farmer's beacons Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Farmer found an old ledger of beacons in the mill attic at the ivy courts of Vineward. The margin notes pose a precise question. 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: 3267 921827158 775312775 17222736 350608577 388230211 667030728 717436828 432101138 714349288 319946253 349838740 659850545 820732931 38310735 178686400 737353345 961430018 543642130 505554841 338585084 899823003 339416042 973678883 701502646 437444616 952757225 838397930 417869112 169301041 104266795 196000373 702942053 425783502 507727199 119940406 129391171 169455284 349294258 710642862 885239408 623025696 710956845 990242686 558323983 922986406 399375321 278583237 585582091 917908795 541834760 369611571 934089445 277955849 868240100 343243054 294962432 13435224 945005166 430310026 330788773 299176693 27961597 942073051 438052813 270951546 579455235 612751592 687806726 201345649 112031294 930812994 430626771 79914177 124464629 824886443 979831749 712799967 248596925 853680481 207800528 …
Output: 1 1 1 2 3 4 5 1 2 1 2 3 12 1 2 3 17 1 1 1 4 1 23 1 1 3 1 1 1 1 3 5 1 2 1 2 3 4 12 14 1 2 43 1 2 1 1 3 4 1 1 9 1 2 1 1 1 15 1 1 1 1 5 1 1 3 4 5 1 1 8 1 1 2 4 33 1 1 3 1 1 2 4 5 1 2 1 4 5 90 1 1 3 1 1 2 1 5 9 1 2 3 1 2 3 16 1 2 19 1 2 1 2 1 2 1 1 2 10 1 1 1 4 1 2 1 4 1 6 1 22 1 1 2 1 2 28 1 2 1 2 1 2 1 8 1 1 3 1 1 3 1 1 2 4 1 2 1 50 1 2 1 4 5 6 1 1 1 4 1 2 3 1 1 2 3 1 2 1 71 1 1 1 2 3 4 1 1 3 4 1 1 2 4 1 1 3 1 5 1 201 1 2 1 2 1 2 5 1 7 1 1 2 3 1 1 3 1 9 1 2 1 1 1 1 16 1 1 1 3 4 1 6 31 1 1 3 1 2 3 7 1 42 1 1 3 1 1 1 7 1 1 1 3 1 13 1 2 16 1 1 3 4 1 1 7 1 2 1 27 1 1 1 1 5 6 1 2 3 37 38 1 2 1 1 3 1 2 3 9 1 1 2 4 1 1 3 1 2 6 1 21 1 2 24 1 2 1 1 1 2 5 1 2 1 4 1 2 1 1 2 17 1 2 3 1 2 3 48 1 130 1 1 3 4 5 1 1 1 4 1 1 7 1 9 1 2 3 13 1 1 1 2 5 1 7 1 1 2 1 1 5 1 2 1 4 10 1 2 1 35 1 2 3 1 1 2 4 1 6 7 1 1…

Example 2:

Input: 3815 308490173 633386067 699733288 673230976 656781827 832319545 412579808 323333223 535531623 278204825 382952194 323426945 242867661 371818284 86398011 864696204 205091139 716973666 356180251 553348810 458593339 37015231 346215770 706723559 927602261 728614848 747769823 603433115 195590103 581862273 524009332 449426569 49245500 61445114 200065418 530609199 957038552 497269719 307582183 258136044 511391213 820087657 438939863 722821567 353412698 826019903 655942909 906023025 676870148 171155309 396831476 770181962 777100592 853916595 557854900 70811240 633918450 575602964 379586436 634614895 879710865 595751864 619547360 744001077 657456715 606604031 745167683 162715700 482911489 91278132 644715392 206131039 563698441 481167080 435520088 852194347 762041595 781141370 993784933 366556992 9…
Output: 1 2 3 1 1 6 1 1 3 1 2 1 1 3 1 16 1 2 1 2 1 1 2 6 25 1 2 1 1 2 1 1 1 2 3 6 37 1 1 1 4 5 1 2 1 9 1 11 1 1 2 4 5 6 1 1 3 1 1 6 13 1 2 3 1 1 6 1 2 1 4 1 2 1 1 15 1 2 79 1 2 1 2 1 1 5 6 9 10 1 1 3 1 2 3 7 1 1 10 1 2 3 1 5 1 1 1 9 1 1 1 1 2 1 2 1 1 3 9 1 13 1 1 1 1 5 28 1 2 1 4 1 6 1 1 9 1 11 12 1 2 1 2 5 1 7 1 2 3 1 5 1 2 8 1 2 18 1 20 1 1 1 163 1 1 3 4 1 1 2 8 1 2 1 2 3 6 1 2 9 1 1 3 1 5 6 1 2 3 1 1 12 1 1 1 3 4 6 1 1 1 2 23 1 2 3 4 45 1 2 1 1 2 1 2 5 1 2 8 1 1 1 4 1 6 1 19 1 2 3 4 1 1 7 1 2 1 1 2 1 1 8 35 1 1 2 1 4 1 1 3 9 1 11 1 1 3 4 1 6 18 1 2 1 1 3 1 2 1 4 28 1 2 1 1 2 3 1 1 2 1 4 1 1 12 1 14 1 2 3 4 21 1 1 1 1 2 5 1 1 1 10 11 1 1 1 1 1 3 6 1 8 1 2 12 1 1 15 1 2 3 4 1 2 1 2 3 1 2 1 4 1 30 1 2 1 45 1 2 1 2 3 1 2 3 4 1 9 57 1 1 1 1 5 1 2 3 1 1 1 3 13 1 1 1 17 1 2 3 21 1 2 1 2 1 4 1 1 3 1 5 …

Example 3:

Input: 3708 891417029 439072645 783697355 869553455 413576777 771738682 860096057 152173318 179177448 583307069 45845083 433348140 3045948 722094615 571847195 248819218 81167707 360366425 302816438 7212046 92950810 845329231 941962327 336141985 952173063 429327760 392219950 918472240 654394919 919535018 586493535 234548114 107839244 749893634 572044224 332269191 617746690 48073115 303778273 904894359 63228988 55653879 522257410 149452728 580731991 762277674 458140632 401309369 354014312 639872521 626706416 472944441 656022938 979207450 152915575 831903944 876146970 587463278 221003420 61801040 882365508 715115748 946149015 583526981 465409916 542160375 604327698 940441028 144205985 452043831 921512679 796197024 654709736 936552201 802214057 537130614 976010707 893001052 99557748 409268170 1116637…
Output: 1 1 2 3 1 2 3 1 2 3 1 2 1 7 1 1 1 3 1 1 2 15 23 1 25 1 1 3 1 5 1 1 1 4 1 1 3 1 2 10 1 1 3 1 5 6 1 1 1 4 1 1 7 54 1 2 3 1 1 1 7 1 9 1 1 2 4 5 1 2 3 1 1 6 1 1 23 1 1 2 1 4 1 6 1 2 9 1 1 3 1 1 1 3 95 1 2 1 1 1 2 4 1 1 10 11 1 2 1 1 5 1 113 1 1 2 1 1 3 7 1 1 10 1 2 3 1 2 1 1 1 3 20 1 1 3 4 5 1 1 1 9 10 1 2 3 1 2 6 1 8 1 2 21 1 2 1 1 5 1 2 3 9 1 1 3 1 2 36 37 1 2 1 2 1 6 1 1 2 4 5 1 2 14 1 2 1 2 1 1 3 1 2 6 11 1 1 1 4 1 17 1 2 1 2 1 4 1 1 7 1 2 1 11 12 1 84 1 2 1 1 1 1 3 5 9 1 1 2 4 1 2 3 1 5 1 2 1 1 1 1 4 1 14 1 1 1 1 1 3 1 2 7 8 1 1 3 1 29 1 2 3 1 2 35 1 2 51 1 137 1 2 1 2 1 1 1 6 1 2 1 2 170 1 2 3 1 2 3 1 1 6 1 1 3 1 5 1 2 1 2 5 1 1 8 1 2 3 1 2 1 1 5 1 23 1 2 1 2 3 4 5 1 1 42 1 44 1 1 3 1 2 6 1 2 1 1 2 3 5 1 1 2 1 18 1 1 1 4 1 6 25 1 2 1 1 3 31 1 2 1 1 5 1 1 3 4 1 11 1 2 1 2 1 1 3 6 1 52 1 2…

Constraints:

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

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