CT53283

Cleo's beacons Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the lantern district of Glowfen opens only for a perfect tally of beacons. Cleo 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: 259 133446579 466410014 216883659 411158 961590900 370075128 748601848 889251786 712684335 870227242 664496432 171236707 705103956 7264212 529838878 518246681 184222073 774625332 342641793 843825347 889179623 218678785 621232933 976203203 845757216 427619117 407869983 913470461 756742849 432080881 242532103 753107650 458137495 539538866 987671885 269031829 623563545 176671863 316784426 710570159 555782914 832483338 702636933 554966113 116521232 546993644 257785486 987031631 309179161 596725575 49619053 741335753 617515133 449469601 109852339 298342479 992744779 894262432 199359892 476216166 611310075 208697246 161927864 720270060 205360418 292489156 2820452 124522693 210720444 144310269 644434802 937201122 975040140 664265252 665706845 844149865 531018365 922390196 796681637 313772089 4664…
Output: 1 2 1 1 5 1 2 3 1 2 1 1 3 1 2 1 1 8 1 10 13 1 2 24 1 1 1 4 1 1 1 3 1 2 35 1 2 1 2 5 1 7 1 1 1 2 1 13 1 2 1 4 1 1 1 2 57 1 1 2 3 1 1 6 1 2 1 2 3 1 7 15 16 1 2 3 1 5 1 1 2 1 2 5 1 8 1 2 1 1 2 4 1 1 3 18 1 25 1 1 2 4 1 2 1 4 9 1 2 3 1 2 6 57 1 2 1 2 1 2 1 4 9 1 2 1 2 1 2 3 4 18 1 20 1 2 1 1 1 1 1 5 1 7 1 12 1 1 1 150 1 2 3 1 1 6 1 1 2 4 5 1 1 3 4 1 1 1 8 1 2 3 1 13 1 1 1 1 1 24 1 1 2 3 35 1 2 1 1 1 3 5 1 1 3 1 47 1 1 3 1 2 3 1 5 1 10 1 12 1 1 15 1 2 1 4 5 1 1 2 1 1 1 6 1 1 2 1 32 1 2 1 1 3 1 2 1 2 1 4 1 13 1 2 3 17 247 1 1 3 1 5 1 1 1 2 3 1 6

Example 2:

Input: 978 935125363 279277965 849750181 941909247 39806050 829640310 512333022 521643763 61089538 15995946 494458567 534958633 541256826 554921828 138949267 179411173 157148393 491125850 40412910 492829594 547431313 445743002 931562200 211277981 917206950 222195714 180516662 378443864 186691106 839732050 733991226 643382132 274898178 427404657 660837539 222888040 175978859 197229619 781600382 753713078 404242611 298108098 278137059 229410708 676063381 987380901 848825718 402222251 8915321 439059767 888719743 310253805 690422295 106257315 187761200 776685041 546299823 941853618 600835311 184866246 851389578 341355000 828175600 893047383 423208625 761465287 882891789 797736599 712622406 106395260 386933568 374424719 376613715 699526582 284609795 472832705 121588503 21803722 212696988 587551849 946…
Output: 1 1 2 4 1 2 1 2 1 1 3 6 7 8 1 2 1 4 1 6 7 1 19 1 2 1 1 3 1 5 1 1 1 2 4 1 1 2 9 1 1 1 1 1 5 46 1 1 1 3 5 1 2 1 2 5 1 12 1 1 3 1 2 6 1 2 3 1 1 1 2 1 2 5 1 2 1 1 3 6 35 1 2 1 4 1 1 2 8 1 2 3 4 13 1 2 1 4 5 1 1 3 1 58 1 1 1 2 3 4 7 1 2 1 11 1 2 14 1 1 2 3 4 1 2 1 1 5 1 2 1 1 2 4 5 1 2 1 1 1 2 23 1 2 3 4 1 2 3 4 1 2 1 1 51 1 1 3 1 1 2 1 8 1 2 11 1 2 1 4 1 1 3 19 1 1 2 4 5 1 1 2 1 4 6 1 1 3 15 1 2 3 4 1 1 1 2 5 6 1 2 1 2 11 31 1 2 1 4 1 6 38 1 2 1 2 3 1 2 8 1 2 1 1 121 1 1 2 4 1 2 1 4 5 10 1 2 1 239 1 1 3 1 2 1 4 1 1 10 1 2 3 4 1 6 1 1 1 3 11 12 13 1 1 1 4 1 1 7 1 2 1 1 3 13 14 1 1 2 1 2 1 6 1 1 3 1 2 6 14 1 2 1 2 1 4 5 6 7 10 1 1 3 4 1 2 3 1 2 1 1 8 1 2 1 16 1 2 319 1 2 1 1 1 2 5 1 1 10 1 2 1 4 1 2 1 1 1 1 3 4 1 8 1 1 27 28 1 1 3 1 2 6 1 1 1 10 1 1 1 3 1 1 3 8 1 2 1 2 1 2 3 8 17 1 1 3 4 5 1 2 8…

Example 3:

Input: 698 284153161 900746443 374639045 968470898 774000778 612146280 768299015 798283121 552480318 862234828 858147098 218864073 254520753 710114777 421944826 631799574 203830593 54448921 626933907 79547088 732598823 698456036 910355464 330349633 298938630 802091926 441844041 38098140 667001500 992039316 779612203 788266708 396258058 640870029 272684858 975757299 971977646 980429088 345876489 595006862 261492354 229917519 805472619 31424527 659296056 89136950 760647473 200113086 150974666 206054841 663620387 787463755 110551661 296684306 552111685 702310648 82807123 69999658 213124218 490362456 536793271 27020430 864399994 52744616 973540443 333923035 466242658 605564 211315647 881947783 668951960 418281999 521357955 24839638 185819635 278553507 158649496 445024927 783285077 635858515 654092384…
Output: 1 2 1 4 1 1 2 4 1 6 1 1 2 3 1 2 1 1 3 1 10 1 19 1 1 3 1 1 3 30 1 2 1 2 1 6 1 8 1 2 1 1 5 1 2 1 4 1 1 3 4 9 1 2 3 4 1 1 3 4 5 1 25 1 27 1 2 1 2 5 1 1 2 1 2 3 1 5 9 1 2 1 1 14 15 1 2 1 1 3 4 7 1 9 1 2 59 1 2 1 2 3 6 1 2 1 4 5 1 2 3 1 1 11 1 1 3 15 22 1 1 2 1 2 3 6 8 1 1 2 3 4 1 1 7 1 1 2 1 2 1 7 1 16 1 1 1 1 4 22 1 1 2 1 5 1 2 3 1 2 6 35 1 67 1 69 1 2 3 1 1 3 1 1 9 1 2 1 2 1 4 5 1 2 10 20 1 2 3 1 5 1 96 1 2 3 4 1 2 3 1 2 3 4 12 1 1 1 4 1 6 7 1 2 3 1 2 3 14 1 2 3 1 2 1 2 197 1 1 2 3 1 1 7 8 1 2 3 4 5 1 1 3 1 2 19 217 1 2 1 4 1 1 7 1 2 3 1 5 1 2 3 1 1 3 19 1 1 2 1 1 3 7 1 2 1 11 1 1 3 1 1 2 18 1 1 1 1 5 1 2 1 2 10 1 30 1 1 1 1 3 6 1 1 9 1 2 3 13 1 2 1 1 1 6 1 1 1 53 1 2 1 1 5 6 1 1 2 1 11 65 1 1 3 1 2 3 7 1 2 1 76 1 2 1 1 2 3 1 2 6 1 8 1 1 12 1 1 112 1 1 2 4 1 1 2 1 9 1 1 1 3 1 5 1 1 1 19 1 2 …

Constraints:

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

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