CT42594

Elio's Streak Back Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the steppe camp of Horselord Plains opens only for a perfect tally of marks. Elio 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: 3386 438539278 783924766 165678249 471576888 952816982 214877879 322357874 344292357 381921969 963365988 394108421 827687768 455169574 129990871 546011795 398112069 703669073 654635506 657204707 915520480 784665694 850216954 34372041 553337666 55445078 870127864 780508903 99145719 290050601 506692009 852626315 603009977 848882773 996521185 296946427 240461974 462792537 986658742 486142490 260498681 756272533 224096964 276896841 509597953 48327886 110710405 433711959 828867499 986129087 960887329 838753411 472602337 147643715 486945615 853113601 214989115 97846895 453869948 722100033 145015630 178842162 916216207 567846245 716815810 94906039 284813228 737077163 722943099 401138375 188909411 398691472 468210753 649815976 128066839 934525129 750341662 230458538 22355514 657777974 918894020 20…
Output: 1 2 1 2 5 1 2 3 4 10 1 2 1 1 3 1 5 1 2 10 1 2 1 2 1 6 1 1 2 3 5 1 2 34 1 1 3 4 1 1 3 1 2 3 1 2 3 10 11 1 1 1 1 3 5 1 1 3 4 1 2 12 1 2 1 2 5 1 1 1 2 4 5 1 25 1 1 1 3 5 1 1 3 1 2 1 1 1 1 3 5 1 8 9 1 2 1 2 1 6 16 1 1 3 4 1 6 1 2 60 1 2 1 2 1 4 1 1 3 4 11 1 2 1 2 1 2 1 2 3 97 1 1 1 4 1 1 2 1 4 1 1 7 8 1 2 1 1 2 1 4 17 1 23 1 2 1 1 125 1 2 1 2 3 1 2 1 7 8 1 1 1 2 3 1 6 1 2 1 21 1 1 3 1 2 1 4 5 1 1 2 1 2 3 1 16 1 1 1 166 1 1 2 1 4 1 7 1 1 3 1 2 6 1 15 1 2 1 1 3 6 1 2 9 1 1 3 4 1 1 2 8 1 1 1 36 1 2 1 1 3 1 5 1 9 1 2 1 1 2 3 7 17 1 2 1 21 1 2 1 4 26 1 1 2 1 4 1 7 1 2 1 2 1 1 2 3 1 2 7 1 9 14 1 2 1 1 1 20 1 1 1 4 1 2 1 1 1 1 5 8 1 10 1 2 3 1 1 2 41 1 2 1 1 3 1 2 6 7 10 1 2 123 1 1 2 3 5 6 7 1 1 3 4 1 2 1 1 5 1 2 3 1 2 1 2 3 1 1 6 21 1 2 1 1 5 1 2 359 1 2 3 1 1 3 4 1 2 1 1 3 10 1 2 3 1 15 1 1 1 4 1 …

Example 2:

Input: 3107 881879969 377356650 104107187 877993202 326928341 157947841 249105945 603903634 685921673 503859889 110875092 352933881 936905164 721122983 281542349 676291557 202260650 913895921 537853871 991127467 75087492 939183065 578170228 93104091 675248755 140830250 95253736 638102967 179641995 705330887 266225189 507565718 504920860 404185653 290900753 713156223 911498961 484146529 800947848 734104647 553135695 650749290 546542362 17084920 1203160 873246677 92213398 142841317 394015901 133072184 545459408 944671685 618281955 809248373 941386237 855067127 663687642 380912418 28709229 815951065 950836066 615735844 585995924 990098856 328132218 628140056 748731659 563867900 346172627 765096267 649671486 979198440 469213432 242362408 533807088 943011018 808233079 262268438 832602693 915153478 711…
Output: 1 1 1 3 1 1 2 4 5 1 1 2 13 1 1 2 1 5 1 20 1 2 1 1 3 1 1 3 1 8 1 2 1 1 1 14 15 1 2 1 1 2 1 1 1 9 1 2 3 1 5 32 1 2 3 1 1 1 1 4 41 1 1 44 1 2 3 1 1 6 1 8 1 1 3 4 1 1 3 4 1 1 3 1 2 1 2 1 6 1 1 12 1 22 1 2 1 2 3 1 2 8 1 2 1 1 2 1 7 1 2 1 4 1 1 14 45 1 2 1 1 1 2 5 1 2 1 11 1 2 3 1 2 6 1 2 1 2 1 23 1 78 1 2 1 4 1 1 1 1 3 1 153 1 2 1 1 1 6 1 1 1 4 1 2 3 4 1 2 3 1 13 1 1 2 4 1 2 3 21 1 2 3 1 1 33 1 1 2 1 2 3 7 1 1 1 3 4 1 1 7 1 1 3 1 2 6 1 2 3 4 1 2 1 2 1 4 17 1 2 20 36 1 1 2 3 1 1 3 1 1 1 3 5 1 14 1 1 2 3 1 89 1 1 1 2 1 6 1 1 9 1 1 1 4 1 6 1 17 1 2 1 2 5 1 7 1 9 1 2 1 1 2 1 4 1 9 1 2 1 2 3 1 2 17 1 1 3 1 1 1 2 4 1 1 3 55 1 1 2 4 1 2 3 1 2 1 2 1 1 3 6 1 1 2 10 1 1 3 1 5 25 1 2 3 4 1 1 2 1 2 1 4 8 1 14 1 2 1 4 5 1 1 1 1 3 4 6 1 9 1 30 1 2 3 1 2 3 7 1 2 1 1 5 1 2 1 4 1 6 1 2 51 1 2 3 1 5 1 1 8 1 10 1…

Example 3:

Input: 1156 290884063 171037037 479404922 483576088 715772962 281261843 408984064 377772698 216712143 594608955 559665065 371513506 84499692 323601794 491677555 728267254 979326156 985486734 183863290 154150750 582561105 165647082 351841051 200494356 222102296 309264994 72781526 447510664 237035524 128288684 844592199 326834533 635823505 112379585 659638715 825347482 537831449 16420104 315394396 314295218 33207925 43011822 964030821 958156689 40363371 278645470 62303097 102465510 68831169 691844470 350652455 838773469 415219198 296305286 243126833 703529686 603546778 78645156 281347159 417620942 856572367 223072511 406378768 207855665 923426698 294763672 707448217 975054201 281930306 529657883 6675079 970487178 482871447 420538864 591075231 217155568 231836310 264912696 859632746 892110493 742619…
Output: 1 1 3 4 5 1 2 1 1 5 1 1 1 2 4 16 17 18 1 1 3 1 2 1 2 3 1 7 1 1 13 1 2 1 4 5 1 1 2 1 1 2 25 1 1 2 1 2 1 6 1 8 1 1 1 4 1 1 2 3 17 1 2 1 21 1 2 50 1 2 1 4 1 1 3 1 2 3 7 8 1 1 1 3 4 5 1 2 9 18 19 1 2 1 2 1 1 2 8 1 2 3 1 13 1 2 3 1 2 3 1 1 3 10 1 12 1 2 1 48 1 2 105 1 2 3 1 2 3 1 1 1 4 1 9 1 2 3 1 1 2 1 4 6 1 146 1 1 1 1 4 6 1 1 9 1 2 1 2 1 4 1 2 1 19 1 1 2 1 5 1 1 2 3 29 1 1 3 1 1 2 36 1 2 3 1 5 1 43 1 2 1 1 3 1 2 1 1 10 1 1 1 2 5 6 1 8 1 1 1 1 13 1 1 2 1 4 1 6 21 1 2 1 2 3 1 2 6 1 1 3 1 5 12 1 2 38 1 1 1 52 1 2 1 4 1 1 7 1 2 1 106 1 1 3 4 1 1 1 8 9 1 1 2 1 1 1 6 1 2 1 1 3 1 7 1 15 16 1 2 3 1 1 6 1 2 1 2 3 28 1 1 3 4 1 1 3 1 2 1 7 12 1 2 3 1 2 1 1 1 1 3 23 24 1 2 3 1 5 1 1 3 9 1 1 3 4 1 1 7 1 2 1 2 1 2 1 2 7 1 1 12 1 1 3 1 2 3 7 1 90 1 2 3 1 1 6 1 1 2 3 1 6 1 2 1 1 1 4 5 1 15 1 2 3 1 1 2 4 8 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Elio's Streak Back Ledger - MEDIUM Coding Problem | CodeTikki