CT48155

Frosted beacons Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the savanna camp of Amberplain opens only for a perfect tally of beacons. Ranger 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: 3912 453695461 615110773 105986401 363497523 79212816 225168137 892322969 311644985 393025688 726327930 922503481 690281853 77721416 301802417 571760348 844078813 70626434 755694814 190213063 476152868 356021666 864791051 341538237 904800067 743486419 925497741 469873346 906987846 767018122 441339502 272333367 841680810 651541116 184894923 682018042 339683978 677225392 330724727 448905077 723032294 63405700 575541945 77579533 904237694 229247555 478872358 605528021 72860131 791738303 868497403 41386549 100894872 766650376 509800993 708970593 469432888 410397247 968942543 488282578 849280765 96427114 583646893 314371306 762894307 94603842 646659337 405822191 287152980 859889556 88049473 973570158 504206128 168907865 365082799 413277869 504487247 317904072 443983117 235990178 65480147 668768…
Output: 1 2 1 2 1 2 7 1 2 3 11 1 1 2 3 5 1 2 1 2 1 11 1 13 1 26 1 2 1 1 1 4 1 1 3 1 2 1 2 8 1 2 1 16 1 2 3 1 5 6 1 2 3 1 2 1 1 58 1 2 1 2 1 4 1 2 1 1 11 1 71 1 1 2 3 5 1 2 1 1 10 1 1 2 14 1 2 1 1 5 1 1 2 4 1 1 1 2 5 1 1 3 1 14 1 2 1 2 5 20 1 27 1 114 1 1 1 3 5 1 2 1 1 10 1 1 1 3 1 6 1 1 1 20 1 1 2 4 1 2 1 4 1 2 11 1 2 3 4 1 6 1 1 40 1 1 2 3 5 1 1 1 1 4 5 1 7 8 1 16 1 2 1 2 5 6 1 1 2 4 27 1 2 1 2 1 6 1 2 1 1 11 1 1 2 15 1 2 1 1 2 3 22 1 1 2 1 5 1 1 1 2 3 1 6 1 1 3 1 39 1 1 1 4 1 1 3 1 1 1 7 1 2 1 4 1 123 1 2 3 1 2 1 1 2 1 2 6 12 1 2 3 4 1 1 3 1 9 1 1 1 2 4 15 1 2 3 1 1 6 7 8 1 1 1 2 1 1 1 31 1 2 1 2 5 37 38 1 2 1 1 5 6 1 1 9 1 2 1 4 1 6 1 17 1 1 3 1 5 1 2 8 1 2 66 1 2 1 2 5 1 1 2 3 1 1 213 1 1 2 4 1 2 1 8 1 1 3 1 2 1 4 8 9 18 1 1 3 1 5 1 2 1 1 1 4 12 1 2 15 1 2 18 19 1 2 3 1 5 6 7 8 1 1 3 1 1 3 1 1…

Example 2:

Input: 3709 785407045 827604332 871477687 661113141 559924943 313018830 140891020 819177384 40482433 145044387 904165603 457550757 477437423 646000936 876341377 317172962 472196733 911942447 473119873 417564257 11503722 296585251 438249158 598593744 67924829 788355425 469187310 505971531 365548180 927975667 417531380 115417665 283206602 865515979 781557099 540134017 119354099 850760806 752616289 766035451 947909754 209076970 829051229 421207616 700993795 281013758 271784562 573984777 126364698 101212783 491496046 316623214 730574715 628981287 434100146 705363261 830191256 762538845 325211472 886832250 806344335 85289501 463657875 313952054 181950987 201254133 451716522 971546048 482963103 229874444 225880040 874121431 708066002 823091041 851092344 875522043 10364366 565468978 554922132 10177246 9…
Output: 1 2 3 1 1 1 1 5 1 2 11 1 2 3 4 1 2 18 1 1 1 2 4 6 1 8 1 2 1 30 1 1 2 4 1 1 1 4 1 2 41 1 2 1 2 1 1 3 1 1 3 1 10 1 1 3 16 1 1 19 1 1 2 1 1 2 4 68 1 1 1 4 1 2 3 8 1 2 1 1 13 1 1 3 1 2 3 1 1 2 4 11 1 1 1 4 97 1 2 1 4 1 6 1 2 1 4 1 1 3 8 1 2 11 1 2 3 1 2 17 18 19 1 1 1 2 3 5 1 1 1 3 5 1 32 1 1 1 4 1 1 3 1 2 1 2 8 1 1 2 1 1 6 1 1 2 3 1 5 13 1 1 1 25 1 1 1 1 2 6 1 1 3 1 2 3 4 1 6 16 1 1 80 1 1 1 1 4 1 1 3 1 1 2 12 1 2 1 2 1 18 1 1 21 102 1 1 3 4 5 1 7 1 1 3 4 1 2 7 1 2 1 18 1 1 1 1 2 1 1 3 1 5 1 2 12 1 1 2 16 1 19 1 2 1 4 1 2 3 27 1 1 30 1 2 1 2 5 6 1 2 39 1 2 3 1 1 1 3 8 1 2 1 1 2 14 1 2 3 1 19 1 21 1 2 3 4 1 2 3 29 1 2 1 2 1 1 2 3 1 5 1 2 8 1 1 1 85 1 1 2 4 5 1 2 1 4 1 2 1 4 1 1 11 1 2 3 1 2 3 1 1 3 1 2 1 13 30 1 2 1 1 1 2 1 2 5 1 1 1 4 10 1 16 1 1 3 1 2 1 1 54 1 1 3 1 5 1 1 1 4 1 1 1 3 9 1 1 2…

Example 3:

Input: 1450 305790246 752248171 42203885 513228675 50651358 783634033 355708179 732620633 440532871 17868106 244240958 755032964 356898279 513721453 714425118 454476044 208891343 783899542 423907023 772749250 196114526 480158709 845296110 451116345 346595246 986531760 398527408 274663881 780884509 844366869 621294162 518041502 813787128 621773010 966491739 369684464 760487652 578084793 707396255 40243878 85785754 255004060 586182981 232528109 171744893 507996359 472864427 875605112 376504137 265981843 118788620 977004277 41282598 176324229 736330670 847635408 960397971 636023982 247575535 678387635 303762607 959623016 65169428 627009217 434226438 64493413 562119527 904552847 457430544 674875598 330227860 506643380 279393467 599431231 32309899 274231291 997850885 312413456 113053265 50232858 47329…
Output: 1 2 1 2 1 6 1 2 1 1 2 6 1 2 3 1 1 18 1 2 1 2 23 1 1 26 1 1 3 4 1 1 3 1 9 1 2 1 2 1 2 3 4 1 1 3 1 13 1 1 1 26 1 2 3 4 5 1 1 3 1 5 1 2 1 1 3 6 1 2 1 2 1 4 1 2 77 1 1 1 4 5 6 7 1 1 2 1 2 3 1 1 2 1 4 1 6 1 2 3 24 1 1 2 4 1 2 7 8 9 1 1 1 3 1 2 7 1 2 1 11 1 2 3 1 2 3 1 2 1 10 11 1 2 1 1 5 1 7 63 1 2 1 2 1 2 1 2 3 1 1 1 1 1 9 16 17 1 2 1 1 5 6 1 1 2 4 1 6 1 2 9 16 1 1 3 1 38 1 2 1 42 1 2 1 2 3 1 7 1 1 3 1 2 1 1 3 1 10 1 1 3 21 1 1 3 1 1 3 7 1 9 1 2 3 76 1 2 1 4 1 2 1 1 1 4 1 8 13 1 15 1 1 2 1 2 5 6 8 1 2 3 1 2 105 1 1 1 1 4 6 1 2 3 1 11 1 2 1 2 5 1 1 19 20 1 2 1 2 1 4 1 1 2 3 9 1 2 1 1 2 1 1 6 7 10 1 2 3 1 2 3 1 2 6 20 157 1 1 2 1 5 6 1 2 1 1 2 3 5 14 1 2 1 1 3 6 1 22 1 2 3 1 1 2 1 4 1 2 1 8 35 1 1 2 1 40 1 1 2 4 1 1 1 1 5 1 1 1 1 4 1 6 1 2 3 1 1 2 23 1 2 1 4 28 1 2 1 2 5 1 2 1 4 38 1 2 1 2 5 1 4…

Constraints:

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

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