CT36717

The Streak Back at Misthollow

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the valley of Misthollow with crates of beacons, and Tomas the bookkeeper must account for every last one. 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: 989 463652817 642473028 752543893 874655417 366122351 141250164 478922188 330082942 915628375 590838506 255716271 436112053 671530935 324341376 985620822 612557360 437249447 422924907 476643322 184157684 565175776 689314499 112778012 521474782 325097552 189628847 254482502 34682596 778363719 653117944 921923594 320825274 99600294 276567456 135000717 315835354 627851336 384109608 17365858 180557652 65481098 885376411 556234623 899526223 603683298 857634969 255347543 305828736 844615035 57643237 286536099 443927876 130838324 871158629 605461751 615366867 138721582 501794756 533036759 197845753 878268555 239896015 397773500 104941864 886315504 156900397 760061657 666713258 719229899 505057730 209529503 906729387 519308199 415107124 484136565 916678636 321658585 935313862 592669209 14385154 74…
Output: 1 2 3 4 1 1 3 1 9 1 1 2 4 1 15 1 1 1 3 1 5 7 1 2 1 1 2 1 14 1 16 1 1 2 1 4 6 1 1 2 1 11 1 13 1 2 1 2 3 1 2 3 1 10 1 2 1 2 3 1 17 1 2 1 21 1 2 1 2 1 1 41 1 1 2 45 1 63 1 1 3 1 1 1 1 1 9 1 1 3 1 2 15 1 1 3 1 2 1 4 1 9 103 1 1 2 4 5 1 1 2 1 1 1 3 7 1 15 1 2 1 1 2 1 1 2 1 5 1 9 1 1 133 1 2 3 1 2 3 4 1 9 1 1 1 4 1 2 3 1 9 1 2 1 1 1 15 1 2 1 19 1 2 164 1 2 3 4 5 1 1 3 9 1 11 1 1 2 1 5 6 1 2 3 10 186 1 1 3 1 5 1 2 3 4 10 1 12 1 1 1 1 5 1 205 1 2 1 1 5 6 7 1 9 1 1 1 2 4 6 1 8 1 1 11 1 2 1 24 1 1 2 3 1 6 1 1 9 1 2 1 1 1 3 4 1 1 7 1 2 1 12 1 1 2 27 1 1 3 1 2 6 1 8 1 1 1 2 1 4 5 7 1 2 1 2 1 1 15 1 2 3 4 1 2 3 23 1 1 1 1 3 5 1 7 1 9 1 2 3 45 1 2 1 2 1 2 1 4 1 8 1 2 1 12 1 1 1 4 17 1 2 1 1 3 6 1 1 1 2 1 76 1 1 2 1 5 6 1 8 1 1 1 2 1 5 7 8 17 1 1 1 2 1 5 6 1 153 1 2 1 4 1 2 1 4 1 1 2 4 1 6 1 1 3 1 5 1 1 …

Example 2:

Input: 2963 640153247 815467424 541223789 369734424 795684844 930804092 534894680 936008791 768344317 821835331 647086022 151830409 13731121 213482381 720805592 28422424 10221081 79272397 213914582 998615756 798585862 332817358 471466869 167272960 373402351 447087162 150699367 340900993 525719572 625819365 742937408 189516549 79164154 310070463 329070189 85377711 515361957 854790236 974223327 279509928 326335216 184810056 322568470 184845146 468578750 2736662 170698737 791433519 843533687 112253740 502436877 172538578 275587935 238495062 222498521 196325703 126834953 200031856 859367772 595988847 590142903 846666685 942866679 607897669 681002990 835879336 880605534 67687432 658392631 254187461 169203813 469347151 901435920 518134993 585686215 933802107 58708842 762799747 871538970 624312566 63209…
Output: 1 2 1 1 3 6 1 8 1 2 1 1 1 3 5 1 1 3 4 20 1 1 2 1 2 3 1 2 8 9 10 1 1 3 4 1 6 18 19 1 2 1 2 1 6 1 2 9 10 1 2 1 2 1 1 1 1 3 20 1 1 3 24 1 2 3 4 1 2 1 1 3 10 1 2 13 1 2 3 1 2 1 4 1 2 3 1 2 3 1 2 53 1 1 56 1 1 1 3 5 1 2 1 4 1 2 1 1 1 4 1 1 3 14 1 1 2 1 4 5 82 1 2 104 1 2 1 2 1 1 7 1 1 3 4 1 1 1 1 2 1 6 1 1 2 4 1 1 1 4 5 1 2 1 2 1 2 1 8 29 1 2 1 4 5 1 7 1 2 10 11 1 2 3 1 5 1 7 1 2 50 1 1 1 3 4 1 2 3 1 2 6 11 1 1 1 4 1 2 1 2 5 1 2 1 2 1 6 1 1 1 2 4 1 2 7 86 1 1 2 1 5 1 1 1 102 1 2 1 2 1 4 1 8 1 2 1 1 5 6 1 1 1 10 1 1 13 1 2 1 2 1 1 7 1 22 1 1 1 2 4 5 1 8 1 10 1 2 1 4 1 1 7 254 1 1 3 4 1 1 3 4 1 2 7 12 1 2 1 2 1 2 7 20 1 1 2 3 5 1 7 1 2 3 1 12 1 2 3 1 2 1 4 1 1 3 1 2 13 1 2 1 1 1 4 5 21 1 1 3 1 1 1 4 8 1 1 2 1 2 1 1 2 1 4 1 7 1 2 76 1 1 3 4 1 82 1 2 1 2 3 1 1 1 1 4 1 7 1 2 3 1 1 2 4 5 1 17 1 2 23 …

Example 3:

Input: 3825 312542958 322558436 130410484 624003741 533978810 686502803 128924539 677545151 389144987 55874050 554885546 746228795 699022388 824441251 330502714 984139115 50794976 431506383 146249012 893714852 349978139 155445012 264380096 218743872 739917492 264856924 769832092 481663557 927214948 548544437 545137551 436125841 299936678 182286047 252610822 780259668 930378555 565021482 240108678 690532145 354492906 755075706 12167083 740759417 985705369 947045424 291048967 866231253 371807049 104606575 247660247 891133140 485470766 3950957 688912087 845120559 96228079 832876296 609416517 258216675 635875552 625550578 619240795 537098428 750014664 317604696 630069037 181835192 418189985 462428983 757569612 863714874 312783298 119615840 435060056 155815233 379487542 317134045 725248162 942364075 8…
Output: 1 2 1 4 1 6 1 2 1 1 3 12 1 14 1 16 1 2 1 4 1 1 2 1 5 1 7 1 13 1 1 1 1 1 2 7 21 1 1 3 1 5 1 2 45 1 1 2 1 1 2 6 1 1 3 4 1 2 1 1 3 1 1 1 7 1 2 1 2 3 13 20 1 1 3 1 2 1 7 34 1 1 1 4 1 1 2 4 9 1 1 3 1 94 1 2 3 1 2 1 2 3 4 7 1 9 1 14 1 2 1 2 1 2 1 6 7 1 9 1 13 1 2 1 4 18 1 2 1 4 1 2 1 2 27 28 1 1 2 4 1 2 3 1 1 10 11 1 41 1 2 3 45 1 2 3 4 1 1 1 2 5 6 1 12 1 2 1 2 1 2 1 65 1 2 1 1 1 1 7 1 2 3 1 2 1 1 3 1 10 1 2 3 1 2 3 4 8 1 2 3 4 1 1 15 26 1 1 3 4 1 1 2 8 1 1 217 1 1 3 4 1 6 1 2 3 1 5 1 2 3 1 10 11 18 1 2 1 4 5 1 1 3 4 1 11 1 2 1 4 1 1 2 1 2 1 1 2 6 1 1 11 1 13 1 20 21 1 2 1 4 5 1 2 1 4 1 2 62 1 2 3 1 2 3 1 1 2 1 4 1 2 11 1 2 1 1 2 6 1 2 9 1 1 2 1 5 1 1 17 1 2 1 1 5 1 1 1 4 1 6 1 44 1 2 1 2 1 50 1 2 1 1 2 3 1 2 9 1 1 3 63 1 1 3 1 2 1 1 2 3 4 8 1 1 2 12 1 2 1 19 1 2 1 2 1 2 26 1 2 1 2 31 1 1 2 1 2 …

Constraints:

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

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