CT39613

The Streak Back at Beeswick

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Baker inherited the cellar at the honeycomb cliffs of Beeswick along with its curious bookkeeping system for signals. Time to make sense of it. 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: 2011 690154662 864917274 838309856 80679859 717520927 253742785 262265250 717010364 329776571 851867479 391964043 495202760 990679306 711296051 360809590 478360966 75045473 542718948 302733984 787256831 416897769 664278833 532767307 673876250 551695928 283392549 48753988 687718696 483784947 908099646 13432041 828030312 413074559 573814949 134900844 798321845 852853717 481846407 151915500 560659492 687989577 509807621 871209571 676835994 54808563 541401616 128033921 679077675 402116404 278754800 353791412 625085980 915151150 568041422 346384768 18418161 507951372 6332541 821959856 762878733 614516122 33915751 459464229 251375067 195788536 978877475 618793872 625898521 513847946 419535882 827934767 526380906 374548270 213813508 912596618 160108111 935156277 324809232 581806249 691265768 8599…
Output: 1 2 1 1 2 1 2 3 1 8 1 2 13 1 1 2 1 4 1 7 1 2 1 4 1 1 1 8 1 17 1 2 1 2 1 4 7 1 1 3 4 1 13 1 1 2 1 5 1 1 2 4 40 1 1 1 3 1 6 1 1 1 2 1 1 53 1 2 1 1 5 1 1 1 9 1 11 1 2 3 4 82 1 2 1 2 1 2 5 8 1 1 2 1 5 1 1 2 17 1 1 3 1 1 1 2 5 1 1 2 4 10 1 1 1 3 18 1 1 2 1 4 1 2 7 1 1 3 4 1 2 3 8 1 10 1 2 56 1 2 3 1 1 3 1 1 3 4 1 2 1 4 1 6 1 2 3 1 1 3 23 1 2 3 1 1 3 1 1 3 7 1 1 13 1 2 3 4 1 6 1 2 1 2 3 1 2 8 1 16 1 2 1 1 2 4 1 198 1 1 2 3 1 2 1 7 1 10 1 1 2 4 1 1 7 8 1 1 1 2 4 6 1 8 1 2 3 4 1 32 1 2 3 4 5 1 2 3 1 2 1 2 1 4 5 1 7 8 1 2 1 2 3 6 1 1 22 1 2 1 1 1 3 4 1 9 1 2 3 35 1 2 1 2 1 1 2 3 1 10 1 1 2 1 5 1 1 3 4 5 1 2 1 1 2 4 1 6 69 1 2 3 1 5 1 1 1 3 1 1 3 8 9 1 16 1 2 1 2 3 6 1 8 1 2 1 1 2 4 1 6 9 1 1 3 1 2 15 1 1 3 1 1 1 3 5 6 1 2 1 1 3 4 1 2 1 1 11 1 1 2 15 1 1 3 43 1 2 1 1 3 4 5 1 2 8 1 12 1 2 1 1 2 6 1 2…

Example 2:

Input: 3393 693402211 90306131 976426903 443891382 126110503 532359479 739525733 151091906 411071593 392474107 640311427 973022975 112352786 653806194 630458348 795307297 26893734 699868728 436515301 371234101 726412023 215627491 149825013 578959791 685603690 758567639 573322928 768600062 131330527 674957360 153441384 380217961 726923234 737063581 715546829 761947369 23686967 673691404 415601050 675486070 811602338 380458290 848821271 298811215 988213407 900028128 415701333 348911726 983489234 522103770 214178448 854708252 994247092 35491836 566400278 278120734 805987622 102007770 167033660 925837350 244897174 52234365 333132117 632206779 297238564 692805837 128354513 1172553 920148414 566064828 74360110 476559601 957927836 364739347 791830206 628254761 584569552 222415137 511513156 721821123 305…
Output: 1 1 3 1 1 3 4 1 2 1 4 9 1 2 1 4 1 2 1 1 5 1 1 3 4 10 1 12 1 2 1 2 5 6 1 8 1 2 1 4 29 1 31 1 45 1 1 1 4 1 1 3 53 1 2 1 4 1 2 7 1 1 3 4 1 6 1 1 9 1 1 2 20 1 2 1 1 1 2 5 1 1 10 1 1 2 1 1 1 2 8 1 2 1 2 3 4 1 26 1 2 1 1 2 52 1 2 1 4 1 1 3 8 1 1 3 12 1 14 1 2 1 2 1 6 7 1 1 2 4 1 2 7 15 1 1 3 1 5 1 1 2 1 5 1 7 42 1 2 3 1 5 1 2 1 2 10 1 1 13 1 1 2 1 4 1 2 1 2 3 6 1 2 121 1 2 1 2 5 6 1 1 2 1 2 1 7 1 2 3 1 12 1 2 21 1 2 1 2 3 1 202 1 2 1 4 1 6 1 1 2 1 4 5 1 8 1 1 11 1 2 1 1 3 6 1 1 3 1 1 6 1 2 3 1 1 1 4 1 21 1 1 2 1 4 1 1 1 3 9 43 1 1 1 4 5 1 1 3 1 2 1 2 13 1 2 3 4 5 6 7 1 1 3 1 2 1 76 1 2 1 1 1 6 1 8 1 1 1 4 5 1 1 1 4 1 19 1 2 3 1 2 1 1 8 1 10 1 2 1 4 110 1 1 1 3 4 1 1 1 4 10 11 1 1 2 3 4 6 1 19 1 2 1 2 3 6 7 1 1 2 4 1 2 1 4 1 2 1 2 1 14 1 1 24 1 2 1 1 2 1 50 1 2 1 1 3 4 1 1 3 4 9 1 1 3 1 2 3 1 2 3…

Example 3:

Input: 1822 882145305 413467900 728894656 392181767 939445184 167472390 845164507 961322976 243359196 376235212 560394318 887997426 192538427 381215189 512936508 318287481 421449646 410945670 610207878 614316185 696238210 127176942 333153118 95484855 114498874 897158140 896113372 342760538 450501980 846133821 583337997 470030314 136028547 139044461 551993012 561258156 617665800 652012873 315282197 581003507 256130230 157313947 50599836 823570820 373252836 188226296 918188387 550257168 239924444 228325799 767884279 33079152 413566227 470073598 152106783 465828707 514863627 626767751 285599748 873483372 921549767 340776183 338551653 412614376 720358375 857459891 487213849 818081214 415095632 382619902 445072406 414790592 553805834 658615772 554237196 575917249 755043267 734325115 181849231 27656782…
Output: 1 1 2 1 5 1 2 8 1 2 3 4 1 2 3 1 2 1 7 8 9 1 2 1 2 18 1 1 2 3 1 1 1 2 4 5 7 8 1 2 1 1 1 14 1 1 39 1 1 1 4 1 2 3 1 2 6 7 1 13 53 1 1 3 4 5 1 2 1 1 3 1 5 6 1 2 9 1 1 2 1 21 1 1 3 4 1 1 2 3 1 1 2 3 95 1 1 3 1 2 1 1 1 9 1 1 1 2 1 5 1 1 1 4 1 2 1 1 5 6 1 2 9 1 1 3 4 128 1 1 3 1 1 1 1 2 6 1 2 3 1 1 3 4 1 1 3 1 9 1 23 1 2 1 2 1 6 1 2 3 4 1 2 1 2 3 4 1 2 19 20 1 2 3 1 5 26 1 1 2 1 2 3 4 1 8 59 1 1 3 1 5 1 2 1 1 3 1 1 8 1 1 3 1 2 1 7 1 2 3 4 1 2 3 1 9 1 2 1 1 1 1 36 1 2 98 1 1 1 1 3 1 5 1 1 1 3 5 1 1 3 1 5 18 1 1 1 4 1 6 1 1 3 1 5 1 2 3 15 16 1 1 1 2 1 6 1 1 2 26 1 1 3 1 2 6 1 1 3 1 11 12 1 1 3 1 2 3 1 5 6 1 8 1 1 3 1 1 17 1 1 3 1 1 3 24 1 1 27 1 2 86 1 2 89 1 1 1 4 1 6 7 1 2 3 1 12 1 1 3 1 5 6 19 1 1 2 1 5 6 1 1 3 4 5 1 2 1 1 2 6 1 2 1 1 3 17 1 2 3 27 1 1 2 3 1 2 3 54 1 1 3 4 1 1 3 62 1 2 1 1 2 4 1…

Constraints:

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

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