CT56986

The Tangledeep Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Axel runs the gallery at the kelp forests of Tangledeep. Today the books show a list of signals, and the numbers must be worked out before sundown. 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: 2173 412911906 987019084 369906448 701184299 261504630 187741101 42154252 937726734 84955069 995687244 856499643 819697540 381483437 557137608 6605393 710067053 123731473 399655821 269413130 908044709 352271435 468641325 226256233 546915032 28008663 543564687 297924481 483304831 312467085 930820185 107786002 93941597 927879607 955129694 674927785 142406941 842848980 957911964 91777391 742550454 80573903 781192119 194376073 67029214 289415949 462415748 141333232 524338277 837284882 497151099 899183852 887001825 379376223 248082133 879251763 501814185 640792872 984796061 854846845 791393499 10155894 318580710 114710188 775942858 944400393 459615409 725777215 851109802 505946246 444406562 269050916 180996937 844549102 450912821 759205628 734346151 978527970 967240264 590249295 853465219 10667…
Output: 1 2 1 2 1 1 1 6 1 10 1 1 1 2 1 4 1 2 1 10 1 2 1 4 1 2 1 2 1 20 1 1 3 24 1 1 3 28 1 2 1 4 1 1 3 4 1 6 11 1 13 1 1 1 3 1 2 48 1 1 1 2 1 4 7 1 2 3 1 1 1 1 5 1 2 1 19 1 1 2 1 2 1 1 7 1 2 1 4 1 1 3 1 5 1 2 3 1 10 15 1 2 1 4 5 6 1 108 1 1 1 2 1 1 3 1 8 9 1 11 1 1 1 3 5 1 18 1 1 2 1 2 1 7 1 1 1 1 5 1 1 2 1 1 18 1 2 1 1 5 1 1 1 2 10 1 2 1 32 1 2 1 4 1 2 1 8 1 1 1 4 63 64 1 2 3 4 1 2 1 1 5 6 7 1 2 1 2 3 17 1 2 3 1 1 23 1 1 1 4 1 1 2 1 5 1 1 2 3 1 1 3 13 1 2 16 1 1 46 1 1 3 1 1 6 1 1 9 1 2 1 2 60 1 1 3 4 1 6 7 1 1 1 3 1 6 1 15 1 1 3 1 1 21 82 1 2 85 1 1 2 4 1 1 2 4 1 10 1 1 2 4 1 16 1 1 2 3 4 1 1 3 1 10 1 2 29 1 2 1 4 1 120 1 2 1 1 5 1 7 1 2 1 4 1 2 1 4 16 1 1 1 1 4 1 2 1 8 1 10 1 2 1 4 5 1 17 1 2 1 2 5 23 25 1 1 3 1 1 3 1 1 9 236 1 2 1 2 5 1 7 1 1 3 1 5 1 1 1 9 1 2 3 1 1 6 1 2 3 1 5 1 2 1 4 1 1 3 4…

Example 2:

Input: 1245 629139177 185558224 103402423 471450994 233762452 122402909 838482698 918984675 959933372 379335238 261353736 530471394 658023762 176671811 839248781 591383431 832984280 458281465 842572114 221681880 521578026 903681080 100229275 853690011 680359178 290700690 277140982 50530932 257224656 711845050 749011163 192053163 798699585 337787613 641807989 540259065 931002200 813671276 763347005 170503312 644573524 695965279 886653684 983439816 572434523 95836461 187335870 598456617 245001990 298197976 72484972 364345279 343203736 561005692 19478784 740641207 719361265 790454445 395996289 639987897 97253131 105549464 681854714 569753524 27090558 795327971 788176652 785115540 272095874 407894572 985062128 768052591 374581638 380815082 562601782 615099362 224647293 214909938 823601152 96392098 35…
Output: 1 1 1 3 1 1 7 8 9 1 1 3 4 1 6 1 2 1 10 1 2 13 1 2 1 1 1 1 2 6 7 1 9 1 2 1 28 1 1 1 2 3 6 44 1 1 2 4 1 2 1 4 1 6 1 12 1 14 1 2 1 2 5 1 1 22 1 1 1 2 71 1 1 2 3 4 1 1 8 1 2 3 1 5 1 1 3 1 5 1 1 8 1 2 3 25 1 2 3 4 1 2 1 4 9 1 1 1 13 1 1 3 1 5 1 1 3 1 5 1 2 8 1 10 1 1 3 1 33 1 2 1 4 1 1 2 4 1 1 1 3 5 10 1 2 1 2 3 1 7 18 1 2 3 1 1 6 7 1 1 3 1 2 3 1 2 1 2 1 6 13 1 15 1 24 1 1 2 3 1 52 1 1 2 1 2 5 1 2 1 1 3 1 1 13 1 2 3 1 1 3 1 2 22 1 2 1 4 1 210 1 2 1 214 1 1 3 1 2 3 1 2 3 1 2 1 2 5 6 1 8 1 2 1 4 5 1 1 2 9 1 22 1 1 2 1 2 1 1 3 4 1 2 1 35 1 40 1 1 2 3 1 1 1 4 8 10 1 1 2 4 1 2 1 2 5 60 1 1 2 1 5 1 1 2 3 10 1 1 1 4 1 1 1 2 1 10 1 2 3 4 1 1 2 8 1 2 1 4 1 1 3 1 2 1 7 1 1 3 1 2 6 7 37 1 1 3 1 2 3 1 5 1 2 1 12 1 1 3 1 2 6 1 1 1 4 1 2 7 1 1 1 4 12 1 2 3 16 1 2 1 20 21 22 1 1 2 1 45 46 1 1 2 1 2 1 2 7 1 1 …

Example 3:

Input: 2234 265285341 6552427 198316119 925008767 43995785 421468665 190278092 340753373 44703019 324932040 501215765 158010438 757576264 236496779 497764896 691139046 111451312 225078479 519384663 754631604 694410066 58143660 349883748 896900009 83617722 345679472 978777079 957693102 870405800 545444856 686677036 733220127 666069079 604248576 826371692 119838833 53273551 706351181 147191786 363488746 587296016 949366466 791914823 148722915 341429343 660080180 790045174 427814993 675515663 226295719 179699259 956220346 872143922 48582839 925474407 831341292 810474053 31982303 674514769 636169474 828515553 73303317 892207831 756178495 269301005 225193050 442420137 645557521 696271704 65911651 499617752 885911545 980240572 894022974 665213331 816861886 656944467 447557249 386272543 5225584 79333348…
Output: 1 1 2 4 1 2 1 2 1 2 7 1 9 1 2 3 1 2 3 7 1 1 2 20 1 2 27 1 1 1 2 3 1 1 6 1 1 3 1 2 3 14 1 1 2 3 4 1 2 1 1 24 1 1 3 1 1 1 2 1 5 1 8 1 1 1 3 4 5 1 2 9 73 1 1 2 1 1 1 1 5 6 1 1 3 1 2 3 1 1 3 1 5 1 2 1 1 13 26 1 1 1 1 4 1 1 2 4 1 11 1 2 1 1 3 6 1 1 2 1 4 6 1 8 1 2 1 1 1 6 1 2 1 4 1 136 1 2 1 4 1 1 1 1 4 5 11 12 1 2 3 1 1 6 1 2 3 4 1 12 1 1 3 4 29 1 2 1 2 1 2 3 4 9 1 1 41 1 1 1 1 3 5 1 2 1 2 5 1 2 1 2 1 17 1 1 2 1 4 1 2 1 1 2 4 1 8 1 15 1 1 1 2 1 1 6 1 24 1 1 1 2 4 1 7 1 1 34 1 2 1 1 5 1 41 1 2 1 2 5 1 2 1 4 10 52 1 1 2 1 1 2 1 2 61 1 2 1 1 2 1 5 1 9 1 1 3 1 2 3 4 8 1 2 11 1 2 1 2 3 1 5 1 2 10 1 1 13 1 1 36 1 2 1 1 2 3 1 2 3 1 1 10 1 14 1 2 1 1 3 1 5 8 1 138 1 1 3 1 2 1 2 3 1 2 3 7 13 1 2 3 1 1 2 1 1 2 4 1 1 2 11 15 1 17 1 32 1 1 2 1 1 3 6 1 2 9 1 1 45 1 2 3 1 1 6 1 1 3 4 5 1 1 1 3 1 2 1 2 1 10 …

Constraints:

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

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