CT35883

The Streak Back Beneath Rustwood

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the fox den of Rustwood, Rosa studies rows of marks entries. One clean number will settle the guild's oldest argument. 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: 2718 689459623 712640185 606778367 304671350 482016936 613123615 328422190 873824974 828530773 140021005 927569066 442434827 306776455 34798709 885630822 652688425 790911304 52300324 381370552 868671781 296988576 451060124 283561581 658351122 901852990 959042989 96822601 34413972 151772252 863081193 634144347 539759260 183863828 668365842 130893818 656047181 512985582 645971122 729359932 795358803 828457167 205184693 706012695 942154909 864974382 115961752 829875320 272968535 254151716 925679983 688021417 678989558 501760526 938575504 345701971 77168482 287802160 23649573 882978584 395111379 913910211 557457592 345764266 575966394 83547732 254031326 850301758 989486614 485196748 886535867 67706310 522388313 329642278 881541750 307633382 318273721 890792916 358574470 550161878 676474073 418…
Output: 1 2 1 1 2 4 1 8 1 1 11 1 1 1 4 1 2 1 2 5 1 2 1 4 14 26 1 1 3 4 1 1 1 4 1 2 1 2 9 10 11 1 2 18 1 1 2 1 1 6 1 1 1 10 1 1 2 1 5 1 7 1 1 3 1 2 6 68 1 2 1 2 1 4 1 2 9 1 2 3 1 1 3 1 2 3 4 5 1 13 1 1 3 1 2 28 1 2 1 2 1 4 7 1 2 3 1 5 1 1 3 9 1 11 1 2 1 2 1 1 3 4 1 8 11 1 2 1 1 2 17 1 2 1 4 1 2 3 36 1 1 3 1 41 1 2 44 1 2 1 2 5 1 2 1 9 1 2 1 4 5 1 1 17 1 1 1 1 2 3 1 2 9 1 1 3 1 2 1 2 17 1 1 1 1 3 1 2 1 4 1 124 1 1 2 4 1 6 1 8 1 1 203 1 1 3 1 2 1 1 3 6 7 1 1 2 11 15 1 2 3 1 1 2 7 1 9 1 1 1 1 2 1 6 7 1 10 1 1 1 1 4 25 1 1 1 3 1 6 7 1 2 3 1 2 1 1 2 3 5 1 2 1 2 3 1 12 1 1 17 1 2 1 4 1 1 3 8 9 1 2 1 30 1 35 1 2 1 2 1 1 7 1 2 1 2 5 1 2 3 1 1 18 19 1 1 2 1 4 60 61 1 2 1 2 1 1 7 1 2 1 2 1 4 1 2 7 1 9 10 1 12 90 1 117 1 1 1 4 1 6 1 2 1 4 1 2 1 1 5 1 2 8 1 152 1 2 1 1 3 6 7 1 1 2 1 2 1 2 5 1 10 1 1 2 1 2 6 24…

Example 2:

Input: 3948 631012294 60714098 281297965 210049038 586191606 638383439 500991611 749937102 531466230 396022917 863581319 998814580 349871715 106614881 248581317 917075675 660866692 395303360 22940038 124010659 228449471 922528269 288282934 438933886 242121783 226133647 747384017 251386084 892034767 200793812 692980954 260485649 406245839 775209206 103312928 98634240 803629019 951446578 300185780 126042656 674392374 813947056 735705555 196399060 958575798 577386001 32576581 725306129 492997673 779513255 730281599 838916434 478818760 535587949 82414918 415893745 480363992 385278111 443985756 540588182 585094300 508584425 901878012 732239760 42347852 378973584 673149714 62651535 504612662 192743051 306801667 691842678 346376416 794240687 994989819 817814773 703988699 847896456 939172873 303975757 25…
Output: 1 1 2 1 4 6 1 8 1 1 11 12 1 1 2 4 1 1 1 2 3 10 1 2 1 1 5 1 7 1 2 1 2 5 1 1 8 26 1 1 3 4 1 1 33 1 1 3 1 5 1 7 1 2 1 2 3 1 2 8 9 1 18 1 1 2 3 1 2 1 2 8 1 11 63 1 1 3 4 1 1 3 1 5 1 1 3 1 1 1 3 5 1 1 3 9 1 19 1 1 3 4 5 1 1 8 1 1 11 1 2 1 4 1 2 3 8 1 1 1 4 43 1 2 1 2 5 1 54 1 2 1 2 1 2 7 8 1 1 2 1 13 1 2 3 1 18 1 2 1 1 1 1 4 1 2 8 11 1 2 1 2 1 2 7 8 1 10 1 41 1 2 3 1 5 1 2 3 1 1 2 3 1 9 1 1 175 1 2 1 1 1 2 3 8 1 2 1 2 1 1 1 8 1 10 1 1 2 4 15 1 2 3 4 1 2 1 2 1 6 1 2 3 1 2 1 1 3 19 1 1 3 1 24 25 41 1 1 1 4 1 1 2 8 1 10 1 2 3 1 2 1 1 3 1 2 3 1 2 1 2 3 9 10 11 1 1 3 1 1 22 1 1 87 1 2 1 2 1 4 7 1 1 1 3 4 1 14 1 1 3 1 1 2 1 2 6 1 11 1 1 3 4 1 2 1 1 1 3 5 1 2 14 1 2 1 1 5 1 2 3 4 1 1 37 1 1 3 1 1 2 1 5 46 1 1 2 4 1 1 1 1 3 5 11 1 2 1 4 1 2 3 1 2 10 1 2 1 14 15 27 88 1 1 1 1 2 4 1 2 8 1 2 3 1 2 14 1 1 …

Example 3:

Input: 1864 233779569 893121489 472758724 49396245 535658525 479897288 149736476 436372938 206522929 226843943 464151264 506464702 610152533 667529451 346780478 490480193 132948206 788334031 101314572 113206551 206404078 516592341 308949407 132411427 966305678 156241230 144598161 553883980 834405104 606053644 543885390 362571159 410147452 392753712 27829126 876682799 150402609 257107339 638222579 108428629 74862205 375926459 406745146 867701999 971071761 695198712 215644191 627892258 816914910 451256610 636260553 71050362 333117829 524888774 353445161 246554774 839905387 228397229 747881871 597834685 38382432 530473618 282921126 212804792 940724324 553117596 977769759 588156888 752338389 652889718 695963298 134487208 277376166 361816483 766800832 468650413 207249871 576995537 584615756 120455507 …
Output: 1 2 1 1 3 1 1 2 1 2 5 7 11 12 1 2 1 16 1 2 3 4 1 1 25 1 1 3 4 1 1 1 2 1 1 11 1 2 3 1 1 3 4 8 45 1 1 2 4 1 2 1 2 3 1 1 12 1 2 1 1 2 1 1 20 1 67 1 2 1 2 1 2 3 8 1 1 3 4 1 2 3 16 1 2 3 4 1 2 7 1 9 1 11 95 1 1 2 4 1 2 3 1 1 2 1 8 1 1 1 12 1 1 2 1 21 1 1 3 1 2 3 1 1 2 1 2 1 6 1 1 1 14 1 19 1 1 1 2 4 1 26 143 1 2 3 1 1 3 1 8 1 1 1 2 4 14 1 1 1 3 1 1 2 4 5 1 2 1 9 1 2 1 2 17 1 2 1 1 22 1 2 3 1 1 3 4 1 1 1 4 1 10 1 1 2 1 18 1 2 1 2 1 6 1 63 1 65 1 1 3 4 1 2 3 1 1 6 1 2 3 1 1 1 2 18 1 2 1 2 1 1 5 1 9 1 1 2 3 4 1 6 8 1 2 3 1 2 6 1 1 2 1 2 5 1 1 2 4 11 1 1 20 1 22 1 2 1 1 1 3 4 1 6 7 1 2 1 12 1 2 3 57 1 1 1 2 3 5 1 2 1 2 5 1 2 8 1 15 1 2 1 2 5 1 2 8 1 2 1 1 13 1 2 1 4 1 35 1 1 3 1 2 3 1 5 1 45 1 1 3 4 1 108 1 2 1 1 2 1 2 1 117 1 1 1 3 5 1 1 2 1 1 2 3 1 2 10 1 1 3 1 5 6 1 2 1 1 3 6 7 24 30 1 2 3 1 1 3…

Constraints:

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

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