CT53325

The Streak Back Beneath Slitherwick

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the eel marshes of Slitherwick; Darian weighs the day's signals manifests and starts the calculations. 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: 1123 847993549 855492113 865149182 694221936 465664020 109283400 899417578 283588948 289967060 337374639 371919130 654787969 978212802 678547084 381660151 114382555 773845436 581925115 602078769 406039660 154645773 550584103 730740990 615667393 379455406 238894690 400532864 247828015 661936172 339762789 906318632 554914233 520767083 687555130 556660822 532002250 25068905 459464418 336188397 214375122 801029365 988744267 72785691 588181513 194648704 411949917 923951512 314021761 826315009 291584182 214997205 937441689 307782391 115046058 379792228 547338838 370241917 751598451 50766445 843437113 211515066 52780767 628448450 751949692 179351890 186417020 106628206 125891370 193025907 101548371 544622514 955436556 575200447 388480407 128735312 903762726 645089032 126901432 555113865 183566685…
Output: 1 2 3 1 1 1 7 1 2 3 4 5 13 1 1 1 4 1 2 1 1 3 6 1 1 1 3 1 6 1 18 1 1 3 1 1 1 2 1 1 10 42 1 2 1 2 5 1 2 1 1 10 1 1 3 4 1 6 1 8 1 1 3 4 1 2 1 2 5 1 7 30 1 1 1 4 1 1 2 1 2 10 1 1 1 4 5 1 2 1 4 10 1 1 2 1 1 2 7 1 2 1 4 1 13 1 2 1 1 3 1 2 1 72 1 2 1 1 3 1 1 8 1 2 1 2 5 6 1 1 1 3 1 1 1 3 1 1 2 8 1 100 1 1 3 1 5 6 1 1 1 10 11 1 2 3 1 1 1 1 3 5 1 2 3 4 25 1 2 1 2 1 6 1 1 3 1 11 1 1 2 15 1 1 2 1 4 1 7 1 2 1 1 1 3 4 197 1 1 3 1 1 6 1 2 3 4 1 2 3 1 1 2 11 1 1 2 1 5 17 1 1 3 27 1 226 1 2 3 4 1 6 1 1 2 3 5 1 2 8 1 1 17 1 245 1 2 1 1 5 6 1 2 1 4 1 1 3 1 1 16 1 1 2 1 1 1 6 1 8 1 1 1 3 1 1 7 1 2 3 36 1 1 3 1 2 1 4 1 1 46 1 2 1 2 3 1 2 3 1 1 3 1 1 6 10 1 12 1 2 1 4 22 1 1 1 2 1 6 1 2 1 4 1 1 2 8 1 2 3 4 1 2 1 2 1 6 7 12 1 1 3 1 2 1 4 5 9 1 1 2 33 1 2 3 1 1 39 1 2 3 1 1 6 74 1 1 1 4 1 2 3 8 9 1 2 1 4 1 1 2 1…

Example 2:

Input: 2753 438648452 757617719 118625055 77264814 137850415 364955082 131238342 149053902 555714656 875281243 166764348 524738852 688488964 730918752 842161586 899427008 578692607 310347279 74375445 233368664 306864662 85282831 294319352 771998502 753964893 816442131 77498047 869026554 235068421 683922173 942477064 362848174 687423328 312727928 942355391 532477307 793521091 126081020 851297930 193181559 726547051 755873882 878478007 48126414 608661390 88805913 192863835 631222400 248667413 740634365 733900329 503388217 64078303 5360972 783811943 877610801 831407990 477244281 980998076 395713673 780865827 222957468 287406857 550266799 525107599 745520574 163423721 955151211 898156089 604019159 881427312 586094086 361960033 565249215 140347609 738641035 214142862 996330844 817268349 776662243 8537…
Output: 1 2 1 1 3 4 1 2 7 10 1 2 3 4 5 16 1 1 1 2 3 1 2 8 1 10 1 12 1 2 31 1 2 1 4 1 2 1 4 1 2 3 8 1 2 1 2 5 1 7 1 1 1 1 12 13 1 1 59 1 2 1 2 3 1 5 1 9 1 1 2 1 1 2 1 5 1 78 1 1 3 4 1 1 2 1 9 1 2 3 1 1 6 1 1 18 1 2 1 4 5 1 2 8 1 10 11 12 1 1 2 1 2 1 6 1 1 10 1 1 1 4 5 16 1 2 3 1 1 2 7 54 1 2 1 2 1 4 1 1 3 4 1 2 3 4 1 1 1 18 1 1 3 1 2 1 1 3 1 5 1 2 1 2 12 1 14 18 1 1 3 4 23 1 2 1 1 2 1 5 103 1 2 1 2 108 1 1 3 4 5 1 7 1 1 3 1 2 1 2 3 9 1 2 1 4 1 1 16 1 2 3 1 5 6 7 1 1 2 1 2 5 1 2 3 9 1 1 2 1 22 1 1 2 1 4 6 1 8 1 1 2 1 1 2 3 7 1 2 10 12 1 2 1 1 25 1 1 3 1 2 3 1 8 1 2 1 12 1 2 3 1 2 1 2 3 1 1 11 1 2 1 52 1 1 2 1 1 1 104 1 1 2 3 4 6 1 8 9 1 1 1 2 1 5 6 1 18 19 1 1 1 3 1 6 7 1 2 1 11 1 1 1 2 3 6 7 19 1 2 3 1 1 6 1 2 1 1 3 4 7 1 15 1 1 3 1 2 1 4 1 6 25 1 1 3 1 5 6 1 1 1 3 1 2 1 14 1 16 1 1 2 3 65 1 1 3 1 …

Example 3:

Input: 3405 647245243 513861166 159051367 379230993 200562293 299022956 992331263 274816721 533752219 678868813 274469850 500556960 738601354 919548748 819467195 857819849 10183979 614045623 540789172 298192139 669995051 112087791 620602632 412978268 12052709 573063444 561632316 735616859 219673188 770891661 900786803 602423359 415710948 340901683 502026562 640803172 231617777 637416643 562070190 977343090 405698294 386108762 476935980 970035251 467660058 867232398 794108996 195165969 947674447 912160169 663058774 58513369 631354114 487095241 635661690 951062331 383424755 967152203 35952346 690781220 649446069 676862787 519800042 883530141 111567611 459230354 861570364 371619932 907613243 839707202 479912090 513623476 698363694 791501559 387035742 101655392 565724872 594901590 919062880 762398793…
Output: 1 1 1 2 1 2 7 1 2 3 1 2 6 7 1 2 1 2 1 1 5 1 2 1 1 3 1 12 1 14 17 1 1 1 3 5 1 2 1 33 1 1 3 4 1 2 1 1 5 1 1 1 2 1 4 12 1 14 1 2 1 2 1 6 1 2 3 1 11 1 1 2 3 4 1 1 3 4 21 1 2 3 1 1 3 1 29 1 2 1 4 34 1 2 3 4 1 2 7 1 2 3 11 1 47 1 1 1 4 110 1 1 1 3 5 1 1 3 1 1 11 1 2 1 15 1 2 1 19 1 1 2 3 4 5 6 1 1 10 1 12 1 1 144 1 2 1 4 5 1 2 1 1 1 6 12 13 1 1 2 1 1 2 1 8 1 2 1 2 1 1 2 1 7 8 9 1 1 2 13 1 1 2 1 4 5 1 2 45 1 1 2 3 5 6 7 1 2 3 1 1 1 14 1 2 1 1 1 65 1 1 2 4 5 1 2 3 1 1 2 1 4 1 1 11 1 1 1 2 3 6 1 2 3 21 1 1 2 1 5 6 28 1 1 1 4 1 1 1 3 1 2 3 1 2 3 15 1 2 3 19 1 2 1 1 24 1 2 3 61 1 2 1 1 1 1 7 1 2 1 2 5 1 1 1 9 17 1 2 1 4 1 6 1 1 3 1 11 1 2 3 1 1 2 4 5 1 10 1 1 1 1 1 5 1 1 8 20 1 2 1 1 2 1 5 1 29 1 1 3 1 2 1 7 1 1 128 1 2 3 4 1 1 3 1 2 6 1 1 9 1 2 16 1 2 3 4 1 1 1 1 3 1 1 2 13 1 15 1 2 1 35 1 1 1 4 40 …

Constraints:

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

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