CT39268

The Emberfall Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

At the port of Emberfall, Innkeeper records each ledgers in a worn leather ledger. The guild wants answers, not guesses. 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: 3510 315500129 43669793 331585425 973806917 916573940 370495490 327691803 912462058 100811768 532258755 821587886 558277100 473302411 906765240 874833816 539296485 336842785 424119138 343864048 140774582 522401374 138903462 513592961 325173060 271734892 575542343 23959112 383641161 396985782 188586328 335568159 368873223 843599578 943804078 771796148 915883425 235966257 151517436 780820462 293619923 481418831 940918107 877950314 681621373 846894080 777556745 243399213 359710424 25015166 865796275 431597133 663523809 606516689 351098056 668268511 810216931 25324367 898130502 637884154 262769982 500657471 955715298 290013349 659811539 677233907 548063778 318822168 799357374 782934045 491575327 836833518 826087766 353308670 395273298 369556507 275863369 760721669 40791718 943735295 756330841 …
Output: 1 1 3 4 1 1 1 3 1 2 3 1 1 6 1 1 1 2 1 1 5 1 2 1 1 11 1 2 3 1 2 3 18 30 1 2 1 1 3 1 2 8 1 1 2 1 1 2 1 7 1 2 1 1 5 6 1 16 1 1 2 58 1 2 3 1 1 6 1 1 9 1 1 2 1 1 5 1 17 1 1 1 3 1 2 1 8 1 1 2 4 5 6 1 2 1 35 1 1 1 4 5 1 1 3 4 5 1 2 8 1 10 1 2 1 1 1 6 119 1 1 1 3 4 1 1 1 9 1 1 2 1 5 1 2 17 1 2 1 1 2 6 7 1 2 3 1 2 1 2 32 1 1 3 1 37 1 1 3 1 5 1 1 1 4 5 6 12 1 1 2 16 1 1 3 4 1 2 1 2 9 1 27 1 2 1 2 1 4 5 1 1 10 1 2 1 14 1 16 1 1 2 1 4 1 1 7 25 1 2 3 1 1 3 4 1 2 1 2 220 1 2 3 1 1 6 1 8 9 1 1 2 1 1 2 1 1 3 7 8 12 1 14 1 16 1 27 1 1 3 1 2 1 4 5 1 7 1 1 2 1 1 2 4 7 19 1 1 22 1 2 1 2 1 28 1 2 1 2 3 1 2 3 4 1 6 1 8 1 1 11 1 1 1 3 5 17 1 1 1 2 5 1 2 30 1 2 1 1 2 4 1 1 3 1 2 1 1 1 6 14 1 1 1 3 326 1 2 3 1 2 1 2 3 6 1 8 9 1 2 1 2 5 1 1 1 18 1 2 1 1 2 1 28 1 2 1 1 2 1 1 2 7 1 2 12 13 14 1 1 1 3 5 6 7 1 1 1 2 12…

Example 2:

Input: 3939 667877768 384376954 190038877 289696274 529002345 640998205 831626648 986325723 388827707 939104038 771035124 518891862 565784601 853312141 563919107 415870650 654503969 492360229 173057252 719128965 117424153 704662381 268054669 316972112 212635436 822497091 709408821 821065145 842881735 154315872 805844142 839754092 631352622 604174070 113691881 104268535 3700185 439743565 369102148 529695680 894123887 144427376 984618438 799464397 785054013 397462268 45806116 298807505 973924902 80597700 528062587 126949957 992168812 656966496 468892292 576154018 432142715 46642269 669374443 839834596 93749732 771381322 911952881 137183386 267710311 723606161 284683868 202585305 20674604 253133095 611157958 541572881 210654028 248258817 806140646 419881703 462194929 469601868 402233417 545343392 84…
Output: 1 1 1 2 4 5 7 8 1 2 1 1 2 4 1 1 3 1 1 6 1 2 1 2 1 12 1 2 15 1 2 3 1 1 1 1 1 4 1 6 31 1 35 1 1 1 1 2 6 1 2 1 53 1 1 2 1 1 6 7 1 2 10 1 2 3 1 1 1 3 5 1 1 2 12 1 2 3 1 5 18 1 2 3 85 1 1 1 3 1 5 1 1 9 1 2 12 1 2 1 2 1 1 5 1 2 3 4 12 1 1 1 2 5 30 1 2 1 1 1 1 1 2 39 1 2 3 4 1 1 7 8 1 10 1 1 3 4 15 1 2 1 2 1 1 1 8 9 1 1 1 28 1 1 3 1 5 1 1 3 9 1 39 1 2 1 2 1 2 7 1 1 3 1 1 6 1 2 1 4 1 1 1 4 5 1 2 1 2 3 67 192 1 2 1 4 5 1 2 1 2 1 2 5 8 1 2 1 12 13 1 2 1 4 1 1 3 8 9 1 29 1 1 3 1 2 1 2 1 1 3 4 1 6 14 1 1 3 4 5 1 2 1 4 1 2 26 1 2 29 1 1 1 1 4 1 2 7 8 1 2 1 1 5 1 1 3 18 19 1 2 1 23 24 1 1 1 1 5 1 1 3 4 92 1 2 1 1 3 4 5 1 1 8 1 2 13 1 1 3 1 2 3 4 1 1 1 8 1 10 1 1 3 1 1 1 3 5 1 2 1 1 2 3 5 13 1 2 45 1 2 1 1 2 1 2 8 9 1 2 1 2 3 152 1 2 1 2 1 1 2 3 1 5 1 2 13 1 2 1 1 5 1 1 3 9 1 1 3 1 2 3 1 2 9 1 2 3 4 5 6 …

Example 3:

Input: 1982 632203021 236236788 125316045 734809896 267365165 928698365 451470362 534991481 608681027 240263161 938962345 976560060 128702494 597067711 828727667 672652533 320969581 170332448 10175547 957476530 319211207 54325014 814300407 986205174 63023815 593349747 625201346 441691558 594352529 326827312 579373936 23052711 54179231 486137834 817035364 209264063 685077015 405527097 777151433 770591113 683140030 448535608 56067429 130831302 250858067 831012538 634485385 507976431 776420255 712447432 88873278 881319628 150121461 11914793 307476779 407849237 580633946 689630909 799919325 326074202 111722370 347090641 967032136 212121792 747298008 292324576 105164662 146350645 910978663 997922217 622464621 713772373 620427080 738446906 10498822 131027259 714434473 765585705 453678322 584745032 7480…
Output: 1 1 1 4 1 6 1 2 3 1 11 12 1 2 3 1 1 1 1 8 1 1 3 24 1 2 3 1 2 1 2 1 2 3 11 1 2 1 4 1 1 1 1 2 3 22 1 1 3 1 1 28 1 1 3 4 5 6 7 1 1 3 39 1 2 1 1 2 6 70 1 2 1 4 1 2 3 8 1 2 3 1 13 1 1 16 1 1 2 4 5 1 1 2 1 1 5 1 29 1 1 1 1 1 3 7 1 1 39 1 2 1 2 5 1 2 1 48 1 2 1 4 1 2 3 1 5 1 2 1 2 3 1 1 6 1 2 3 17 1 1 1 3 1 6 7 1 2 1 1 12 1 1 3 4 38 1 1 3 4 1 6 1 1 1 2 1 6 1 2 1 2 11 1 1 3 1 2 1 7 1 1 1 3 1 1 31 1 2 1 2 3 4 1 2 1 1 1 4 1 131 1 1 3 1 5 1 1 3 9 1 1 3 4 14 1 1 17 18 1 1 3 4 1 2 3 4 5 1 2 1 9 1 1 3 4 1 15 1 1 3 1 1 6 1 8 1 2 1 4 1 2 3 1 1 1 7 1 1 3 1 5 1 2 1 1 1 4 1 13 48 1 1 1 1 2 1 1 6 1 2 1 1 3 1 1 1 1 1 4 10 1 14 1 1 1 2 5 1 28 1 30 1 1 3 1 2 6 1 2 3 4 5 1 1 3 15 1 48 1 1 1 1 1 6 7 8 1 10 1 12 1 1 2 16 1 1 2 4 5 1 2 8 1 1 3 12 1 1 3 1 2 3 1 8 1 1 11 24 1 1 2 1 2 1 2 5 6 7 1 12 1 1 3 1 2 18 1 1 3 …

Constraints:

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

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