CT39215

The Streak Back at Stonehallow

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the granite steps of Stonehallow opens only for a perfect tally of beacons. Sailor 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: 2240 897392664 355264060 329566919 98488814 334904252 707626024 166311542 649505024 327273705 758802107 597413267 73288886 167861478 663610366 678761918 71927932 398120606 798796900 479824706 688180790 532700989 946274736 345536652 134130067 499857411 790289074 481086231 2139449 142665610 84637362 925478156 436197827 500720103 863443106 433403377 409736138 93371877 858743413 693113624 906526191 255985800 598187399 422559915 100199895 483269950 975916759 510177697 695829097 952942045 674723112 667776570 185760338 347449843 185673764 355774287 570150138 613813334 776289265 888213686 450206793 190683772 310892157 4543780 354401246 139960162 712107382 707140818 988562400 397950781 568374058 603905594 790429730 939454762 469733531 754274732 409119331 706967968 21378071 528936676 900556178 10001…
Output: 1 1 1 1 3 5 1 2 1 9 1 1 2 4 5 1 2 17 1 2 1 22 1 1 3 4 1 1 2 1 9 1 2 3 1 1 1 4 1 9 1 2 1 1 3 46 1 2 3 1 1 1 2 1 4 5 6 9 10 1 1 2 1 4 1 7 1 68 1 2 3 4 5 1 2 1 2 1 2 7 1 9 1 2 1 1 2 6 1 1 23 1 2 1 1 3 4 1 2 9 1 2 1 1 2 38 1 1 2 1 2 1 1 3 8 1 1 3 1 14 1 1 1 3 1 5 1 1 8 1 1 1 3 4 1 2 1 8 1 1 3 4 23 1 2 1 2 1 1 3 6 1 1 1 12 1 1 3 1 2 6 1 2 1 2 1 4 1 1 1 3 1 10 1 1 2 3 1 1 2 38 1 1 1 1 3 1 5 1 7 1 2 73 1 2 1 1 2 4 5 1 2 1 1 1 2 14 1 2 104 1 1 3 1 1 1 4 218 1 2 3 1 1 1 2 1 2 1 6 9 1 1 15 1 2 1 2 20 1 2 1 1 2 1 1 3 1 8 1 1 3 1 1 1 37 1 1 1 3 1 6 7 1 2 1 2 1 1 1 8 1 2 18 1 2 3 1 1 3 4 1 2 1 29 1 2 3 1 5 1 1 292 1 2 1 2 1 1 7 1 1 10 1 1 1 4 5 1 2 1 4 1 1 2 8 1 1 2 4 18 1 2 21 1 2 3 4 5 1 2 3 1 2 11 1 13 1 1 3 1 5 1 2 3 53 1 2 3 4 1 2 1 4 1 2 7 1 2 67 1 1 1 4 1 1 7 1 1 3 4 1 6 7 1 9 1 1 2 3 4 1 2 3 4 …

Example 2:

Input: 2392 56284651 983340354 305350699 829314776 674369102 244187314 84062370 552383086 717767707 229089846 272019963 521467189 160827304 970691826 156411736 977119216 763061961 91658827 188701151 815613788 443065476 847906610 637751986 483621708 781091588 976855545 161989164 391686910 770028215 764070654 376940968 616455565 831303703 64268250 134244664 560546825 318033556 381245504 487539131 679335721 941907585 520648901 649880617 573849268 329760159 791181505 83543289 497971095 9774773 55787181 671660407 937213976 73945836 478325935 233521802 674155413 587882968 787128351 633777586 17982928 533733634 572179117 455018379 607764679 145461822 939955596 524874795 499292994 770502982 662574285 78567155 329502226 886893612 325016540 90217944 595456296 17547564 564925491 525943563 171013230 88321467…
Output: 1 2 1 2 1 1 1 3 5 1 2 3 1 12 1 14 1 1 2 4 1 6 1 1 3 10 1 2 3 1 1 2 7 1 2 3 1 2 3 7 15 1 2 1 1 5 1 2 1 2 5 11 1 2 1 4 1 6 1 1 2 3 1 5 1 25 1 1 3 1 1 2 7 1 1 3 1 2 1 1 8 1 2 1 1 2 3 7 1 1 1 1 5 1 2 96 1 1 1 2 5 1 1 2 3 5 1 2 1 1 1 3 1 1 3 15 16 1 1 2 3 1 2 3 7 1 1 3 129 1 1 1 4 1 1 2 1 5 1 2 8 9 1 1 2 13 14 1 1 2 18 1 2 1 4 1 1 2 1 5 1 1 2 31 1 1 1 1 4 6 1 1 9 1 42 1 2 3 1 1 1 2 1 1 56 1 1 3 1 2 1 4 1 1 3 4 5 10 1 2 3 1 1 3 17 1 19 23 1 1 3 1 1 85 1 2 1 2 5 1 2 1 1 2 1 12 13 1 2 1 4 5 6 1 2 3 4 1 6 1 1 1 4 30 1 2 3 119 1 2 1 4 5 1 1 256 1 1 1 4 1 1 1 1 5 6 1 2 3 1 1 3 1 1 6 1 2 1 1 2 4 1 2 1 16 1 2 1 2 1 2 1 1 1 1 40 1 1 2 4 1 2 1 1 2 1 1 8 13 1 2 3 4 1 1 1 2 3 6 1 2 3 10 1 1 3 1 19 1 2 1 1 2 1 7 1 2 3 1 1 6 1 2 3 10 1 2 20 1 2 1 1 3 6 1 8 9 1 11 1 13 1 1 2 4 1 1 3 1 9 1 1 1 4 1 2 3 30 1 2 3…

Example 3:

Input: 1337 567859333 375950124 989909847 651611173 240943208 106023905 468509369 101191117 277169144 474210557 72505793 288477193 301123898 345884690 461062929 718783863 137961461 658512093 125665401 950981052 174276701 722080614 179228217 56591520 620625825 517859436 216804613 357502758 258838221 386258282 308092199 242536961 852789675 775708348 645122047 870250279 708536840 241531967 585036497 737918630 588810850 538065479 105553472 419680942 545519434 494518746 785933758 912108200 314483670 587149419 362891490 178166314 962006847 733689068 806328589 260778972 923130518 524578100 441584268 542786106 673215548 132489700 412433421 833075204 465421432 875459698 986025905 91583027 637532543 798782505 109061986 172024650 956599163 251804004 380305450 643275938 503630379 162348482 541350643 75013012…
Output: 1 1 3 1 1 1 3 1 2 6 1 2 3 4 5 13 1 2 1 17 1 2 1 1 3 1 1 2 1 4 1 1 13 1 1 16 1 1 2 4 1 1 1 2 4 1 11 28 1 2 1 1 50 1 2 1 4 1 1 3 4 1 2 7 1 9 64 1 2 3 1 2 6 1 2 3 1 1 3 7 1 2 10 1 2 13 1 1 89 1 2 3 4 1 1 3 1 5 1 1 1 3 4 1 2 3 1 1 2 4 1 2 7 1 1 2 1 1 2 1 2 19 24 1 2 1 4 1 2 1 2 3 4 45 1 1 1 2 4 1 6 1 9 1 2 3 4 1 15 1 1 2 1 20 1 22 1 1 1 2 5 1 29 1 1 3 4 1 2 1 2 1 1 3 1 9 1 2 12 1 1 19 1 2 1 2 1 2 3 4 1 1 1 4 9 12 34 1 1 1 1 4 1 1 7 1 2 74 1 2 1 2 3 1 7 1 9 1 2 1 13 1 1 1 4 1 6 1 2 1 2 1 2 3 1 1 103 1 1 3 4 1 1 1 1 4 1 2 1 1 3 1 7 1 2 1 2 3 1 23 1 1 3 27 1 1 3 1 5 6 1 2 1 4 1 2 1 189 1 1 3 1 1 6 1 2 1 1 2 1 13 1 2 3 1 1 2 7 1 2 1 1 3 6 1 2 3 1 309 1 1 1 1 4 6 1 8 1 2 1 2 1 2 1 2 9 1 19 1 2 3 1 2 3 4 1 1 3 8 1 1 3 1 2 14 1 1 1 4 1 1 3 1 2 1 2 8 49 1 1 2 3 1 1 3 7 1 9 1 2 1 13 1 1 17 1 2 3 1 2 3 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Streak Back at Stonehallow - MEDIUM Coding Problem | CodeTikki