CT48456

Hugo's Streak Back Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Hugo inherited the mint at the orchid house of Bloomglass along with its curious bookkeeping system for registers. 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: 1750 429732070 98558556 791118451 647976716 905212345 473345304 12640489 205986505 859099352 950600796 863797889 759926204 689446348 187754012 161253223 111136484 706328688 894837039 130965816 769154631 443663766 931634917 513494849 34945802 457935338 112943837 562318519 809553340 849654379 706108393 230292740 283089574 51409424 694518514 568903896 400217085 285808828 478287704 519184644 936684650 891475201 79868040 393736113 993613156 53916427 887762587 494909601 678247367 666585339 601671862 180514602 570126131 477679210 449976473 267454544 724679101 531752956 720311472 543416332 664622168 443169315 277508440 129734517 380443221 893278046 962273308 457060832 569293454 49461216 594260179 948809483 256886988 624718735 639945220 695771246 32657181 592205471 979598280 352902202 251254861 213…
Output: 1 1 3 1 5 1 1 2 4 10 1 1 1 1 1 1 5 8 1 2 1 12 1 1 2 1 5 6 7 1 1 2 1 4 1 1 1 3 4 30 1 1 2 44 1 2 1 2 1 1 1 2 1 1 1 10 1 2 1 2 1 1 1 3 21 22 1 2 1 4 5 1 2 3 4 1 2 34 1 1 1 4 5 40 1 1 3 1 5 1 2 8 1 10 1 1 3 1 15 1 2 3 1 2 21 1 1 3 1 1 3 28 1 1 1 4 1 2 1 4 5 1 7 1 2 3 1 2 1 4 1 6 7 18 1 20 1 1 3 1 2 3 1 2 1 10 1 1 2 4 5 1 17 1 1 2 1 2 1 7 1 2 1 1 3 1 2 6 1 2 1 1 2 12 1 2 1 4 1 20 1 1 23 1 1 3 1 2 6 1 1 1 4 1 1 2 4 1 2 1 4 5 1 2 1 13 1 15 1 2 1 2 3 1 1 216 1 2 1 1 3 1 1 2 1 5 1 10 1 1 3 4 1 1 3 4 1 20 1 2 1 24 1 2 27 1 2 1 1 3 1 1 6 1 39 1 1 1 2 1 1 2 4 1 49 1 2 3 1 2 6 1 1 3 1 2 1 7 1 1 281 1 2 3 4 5 1 2 1 4 1 2 1 1 14 1 2 3 1 5 1 2 1 4 1 1 2 4 1 2 3 1 2 1 1 5 1 1 15 16 1 1 2 3 1 1 7 47 1 2 1 4 1 334 1 2 3 1 5 1 1 2 1 5 11 1 2 1 4 5 1 2 3 4 1 2 1 2 9 1 1 2 3 5 1 1 22 1 1 1 1 2 1 7 1 2 1 1 3 4 …

Example 2:

Input: 207 495051175 504632216 43003533 51479498 215594462 883625699 735825823 583469159 602485254 595497661 814777484 295425892 989863329 445825037 820289775 564719449 34851359 351044378 844376172 574894580 583096267 180986999 224804716 705996088 947689132 631594940 976295665 962018768 890189651 18607514 437039289 884826632 29580523 650741812 233301810 855097752 217482107 225731971 987633240 551824171 375737937 220692949 466405440 888690070 179988308 940476957 591753493 990426498 509910023 607822577 388078309 706896435 398590714 74532535 238203445 818651302 463751474 904017128 299390463 889818351 375771758 118790097 99001004 727951113 460459354 9536235 695898012 414848053 389012605 448012359 423080689 587502418 278349514 575977085 97677898 640141298 974555517 996321977 525603972 614708248 396213…
Output: 1 2 1 2 3 6 1 1 2 1 5 1 13 1 2 1 1 2 6 1 2 1 2 5 12 1 14 1 1 1 2 3 1 2 1 4 1 2 26 1 1 1 3 5 1 7 1 48 1 2 1 4 1 1 2 8 1 10 1 2 1 1 1 4 1 1 3 1 1 3 1 5 1 2 1 9 29 78 1 2 1 4 1 2 1 2 9 1 89 1 2 3 1 1 2 1 5 1 10 1 2 1 1 3 4 1 6 1 2 1 1 13 14 1 2 3 1 1 6 1 1 9 1 2 1 2 1 2 3 1 7 1 44 1 1 2 1 2 5 1 1 3 1 1 6 7 1 2 3 1 18 1 1 1 2 3 1 6 7 1 1 2 11 1 32 1 2 1 1 1 3 5 6 1 8 9 1 1 2 1 4 1 2 1 4 5 1 1 8 1 14 1 2 3 4 1 21 1 1 2 1 4 1 7 8 1 2

Example 3:

Input: 3647 832318134 676310203 299489383 885410443 343826444 901469215 824883323 420329876 314566480 686787077 648764227 974433078 978356690 842216804 708182845 881523804 702878003 194447901 270945420 631256082 325693598 159895867 121408398 833419896 154191615 234142213 237854663 660288138 702379088 625560308 711220023 413654920 579485985 992628466 40157420 399227799 880971541 709286223 336896568 942224979 945555996 285854909 497477865 827354231 764933384 829435231 869553637 341128287 689217784 957532812 139275356 511517021 102501480 224992965 355640927 818811570 47811281 176892384 242036667 465014316 481111037 379823122 417444376 695574705 472271000 77770956 548795147 190547042 951800754 38818770 894921988 350474989 311313701 102892066 793922618 847413221 334800568 65802313 983191346 503357370 …
Output: 1 1 1 4 1 6 1 1 1 3 1 12 13 1 1 3 1 1 2 3 1 1 1 8 1 2 3 4 5 1 7 1 2 34 1 2 3 1 1 6 7 1 2 3 1 5 6 1 2 16 1 2 1 2 3 6 1 2 3 4 5 1 2 8 1 1 3 1 19 1 2 1 1 1 4 5 1 1 45 1 2 3 1 50 1 1 3 4 1 1 1 1 2 10 1 1 2 3 1 5 1 2 1 4 11 1 2 1 4 1 1 18 1 2 3 1 2 1 1 2 1 10 11 1 1 3 1 1 1 7 1 20 1 2 1 1 5 1 2 1 2 1 4 1 8 1 1 11 1 1 19 1 1 2 4 1 2 1 4 1 6 1 12 1 2 1 2 3 1 1 3 1 1 3 1 1 2 4 16 1 1 1 3 1 1 6 1 1 3 1 2 6 1 1 3 16 1 18 115 1 2 1 1 5 1 1 2 9 1 2 12 1 1 3 1 2 3 1 135 1 2 1 2 1 1 5 1 9 1 2 3 1 1 6 1 2 1 4 1 1 2 4 5 1 1 2 1 4 30 1 2 1 219 1 1 3 4 1 2 1 1 2 1 2 3 6 1 8 1 1 1 3 1 5 7 16 17 1 2 1 28 1 1 1 1 1 5 6 7 1 2 10 11 1 1 1 2 1 2 1 20 1 50 1 2 306 1 2 1 2 1 1 3 1 2 1 7 1 2 1 1 5 1 2 1 1 17 1 1 2 1 4 1 1 3 4 1 2 1 1 5 1 1 2 17 1 2 1 4 1 1 2 1 2 1 6 30 1 2 1 2 5 1 2 8 1 1 1 2 4 61 1 63 1 2 1 2 1 2 1…

Constraints:

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

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