CT48896

The Balmcrest Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the cedar groves of Balmcrest, Yusuf studies rows of signals entries. One clean number will settle the guild's oldest argument. 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: 2156 251693971 40614067 385050685 329504973 811504593 138908142 485794072 701815091 691099553 590933128 798160737 570750849 509134952 512252145 703384020 531873906 664633153 637077679 434173259 207867007 568522316 732231650 801910128 857584691 103398621 766550124 920155393 450611820 360654533 759947663 266341765 123655743 404530608 808042406 372169273 614361296 621153918 246989843 539412340 244839635 409933018 654443649 11361673 378520193 517261283 672686487 61483727 106219131 818346887 259215095 973037209 283857600 32668153 769880785 131849525 477769329 838390870 112465317 353937572 343720754 434027104 122205680 237877350 982707132 9917963 842671566 594942000 26291975 860312489 560765922 636810732 951246204 5599795 802145142 721614451 586473119 93041822 444957107 694348057 881094668 79272…
Output: 1 1 3 1 5 1 2 3 1 1 6 1 1 2 4 1 2 1 1 1 3 11 18 24 1 2 27 1 1 3 1 1 3 7 1 2 3 1 2 1 2 8 1 2 3 12 1 2 22 1 51 1 1 3 1 2 6 1 2 1 4 1 2 64 1 2 1 1 5 1 2 8 1 2 1 1 1 2 4 8 1 1 2 1 1 14 1 1 2 1 1 1 6 1 2 10 1 2 1 2 1 16 1 32 1 1 3 4 5 1 1 2 9 1 2 12 1 2 3 1 2 122 1 1 2 3 1 2 3 1 2 3 1 2 3 4 5 6 1 1 3 1 11 1 1 3 4 26 1 1 2 4 1 2 1 1 3 1 5 12 1 2 41 1 1 1 4 1 2 3 1 2 3 4 1 2 10 1 1 2 59 1 2 1 4 1 2 3 1 2 1 7 71 1 1 3 1 1 2 7 1 2 3 1 2 3 7 1 2 1 1 5 6 7 1 2 3 1 1 3 7 8 16 1 1 3 1 1 6 7 1 1 1 34 1 2 3 4 1 1 3 1 1 244 1 1 1 2 1 1 1 252 1 2 1 1 1 4 1 2 7 1 2 1 11 12 13 1 1 1 4 20 1 1 3 1 25 1 1 2 1 5 1 1 8 1 2 3 1 1 2 4 1 2 3 1 1 10 1 1 24 1 26 1 1 2 3 1 6 1 1 3 1 2 6 1 2 1 2 11 1 1 14 1 2 3 4 1 1 3 8 23 1 31 1 2 1 1 2 3 4 1 1 2 1 1 3 1 7 47 1 1 2 4 1 6 54 1 2 1 4 1 1 3 1 5 1 2 1 1 3 1 7 1 2 19 1 2 1…

Example 2:

Input: 3446 110876247 939756865 292387237 918617947 511068627 35644571 466071658 344034720 413618901 38319776 69727 519129531 907013035 796870585 851879373 260970490 253447953 584622445 781632376 570373219 143070703 379210652 612388183 255432981 743838727 506479409 34774468 245207205 8927599 292337525 314681373 208541106 773368234 350082779 90390530 493233551 823721040 680715813 836156339 121757527 225680212 789918426 423272454 550700432 570901364 632846543 77943703 623571685 989143432 593613100 192337677 385369382 863212962 162790164 832401707 682134841 46281556 613918931 774121603 331901520 50457744 523544827 420154769 502943257 351097973 817515761 259951748 116451647 750569562 306306972 754584865 151353820 140117484 306901483 762142763 815117778 864019512 803248403 360725054 570840397 10249637…
Output: 1 2 1 2 1 1 2 1 2 1 1 8 9 1 2 1 1 3 4 1 1 2 4 1 6 1 1 2 1 4 5 1 14 1 1 3 22 1 24 1 2 3 1 2 3 4 1 2 49 1 1 2 4 1 2 1 1 2 4 1 1 3 1 2 1 11 1 1 3 1 5 1 1 3 9 10 28 1 1 2 1 2 6 35 1 2 1 2 40 1 1 2 4 1 2 7 1 1 3 1 5 1 2 8 1 106 1 1 3 1 1 1 2 3 6 1 2 1 4 5 1 2 3 4 1 1 12 1 1 2 1 26 1 2 1 1 1 6 1 2 3 1 2 3 1 8 1 1 2 4 1 2 3 1 2 3 1 26 1 1 2 4 1 2 1 1 3 6 1 2 3 1 1 12 1 2 1 4 5 22 1 2 1 1 3 4 1 2 7 1 33 1 1 1 3 90 1 2 3 1 2 3 1 2 1 2 1 9 1 1 1 4 1 2 1 2 1 1 3 8 1 2 1 2 1 6 15 1 30 1 1 2 1 2 39 1 2 1 4 1 1 7 1 2 10 50 1 2 1 1 2 1 2 5 1 2 1 2 1 1 3 1 5 1 1 1 2 1 4 1 2 1 1 1 19 1 1 3 1 1 2 3 8 1 31 1 33 1 40 1 1 2 1 4 1 296 1 1 1 1 4 1 1 2 1 4 1 6 12 1 2 15 1 2 3 4 1 1 1 3 1 25 1 2 3 1 1 32 1 1 2 3 5 1 1 1 1 4 11 1 2 1 4 1 2 7 1 1 2 4 1 1 3 1 2 1 1 5 1 10 1 2 1 2 26 1 1 1 1 2 1 6 1 8 1 1 3 4 1 6 1 1 …

Example 3:

Input: 819 549009487 677152480 740075742 656597558 790253499 525107323 177150115 61865207 505102714 462596147 466661344 163540450 408348264 513956723 524194353 835918513 671079728 636063631 535442994 746822039 523278987 147922043 96289136 664329183 614069185 371793199 334157244 422225281 845809468 688788976 538631566 790141673 318217811 841248387 601439713 819264952 22535593 311465342 156275514 516835013 877628404 399087542 904137835 280347325 668526342 744357521 4348462 555851716 624477953 538324238 579195862 962331067 240340892 268748879 276560171 848800485 759997969 683561043 309671850 661686054 910627695 737643094 766639982 190502044 507869316 204169789 664938307 481124143 603948021 161395423 925517706 937252023 396433869 234173597 201533904 194843142 185104209 690043612 205692293 931487184 6…
Output: 1 2 3 1 5 1 1 1 3 1 2 1 2 8 9 16 1 1 1 4 1 1 1 4 1 1 1 3 29 1 1 3 1 5 1 2 1 2 1 4 41 1 43 1 2 3 1 2 3 1 2 52 1 2 3 4 1 1 1 2 9 1 2 1 2 1 4 1 2 1 19 20 1 1 1 1 1 6 1 8 1 1 3 4 1 86 1 1 1 3 1 6 1 2 9 1 1 2 1 2 5 1 1 1 4 1 6 12 1 2 1 16 1 1 115 1 1 3 1 5 6 1 1 9 1 2 1 2 1 2 1 8 1 1 3 1 1 3 139 1 1 1 1 1 6 1 1 3 1 1 3 4 1 1 1 2 4 6 7 21 1 2 1 2 1 1 3 1 1 2 1 2 3 4 1 1 3 1 1 2 21 1 2 3 1 1 1 49 1 1 1 3 1 2 3 1 1 1 1 2 3 7 11 1 2 3 1 1 3 4 8 1 25 1 2 3 1 5 1 1 3 34 1 2 3 1 2 3 1 2 9 1 2 1 4 5 1 2 1 4 53 1 2 3 1 2 3 1 5 1 2 1 2 1 6 12 1 2 1 4 1 6 1 1 9 1 2 3 1 2 1 2 1 2 10 1 2 1 2 5 1 1 1 2 1 2 1 1 1 34 1 1 2 1 1 1 3 5 9 1 1 2 4 5 1 7 1 9 1 1 2 1 1 3 4 1 1 28 1 2 77 1 2 1 2 5 1 2 3 9 1 2 1 2 5 15 1 2 3 1 2 6 1 8 1 25 1 2 1 1 3 1 2 1 1 3 11 1 2 1 2 3 42 1 1 3 46 1 2 1 1 2 3 5 1 2 1 1 12 1 1 1 4 1 …

Constraints:

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

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