CT54327

Keeper's Jade Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Keeper the surveyor watches over the canyon post of Redrock's stores of marks. A careful computation stands between order and chaos. 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: 3348 501955619 559402703 844222206 602431293 754473251 701238798 973575484 836530336 585494595 683875948 58728197 213661802 85330971 801198253 494541153 256152294 192165063 3527203 37103184 523709820 799863285 953822629 264078983 290381967 540883357 264271227 87718794 486905146 253934731 359151952 246347294 662123814 686205882 817177778 327951632 926179642 155713941 784529494 350686932 140941763 273767244 885974009 70015733 642592943 700883642 984184044 297966167 796075324 120212688 73483576 459293487 670652509 912350656 12321473 928166860 513295313 115891848 385888413 604274483 937416720 192295576 91197679 212648782 116451228 104805764 397574883 154831600 198642659 86793416 657846347 90045136 783181777 814571918 990028342 764507128 487783709 121875120 670852178 181314331 410016937 1508627…
Output: 1 2 3 1 2 1 7 1 1 2 1 2 1 6 1 1 1 1 2 6 7 15 1 2 3 1 1 3 1 2 1 10 11 12 1 14 1 2 1 1 2 6 1 2 3 46 1 2 1 1 3 4 7 1 9 1 1 2 4 14 1 1 3 1 1 6 1 2 1 10 1 12 13 74 1 1 1 3 1 2 1 4 1 10 1 1 1 3 15 1 1 2 3 1 1 3 4 1 1 1 2 1 4 15 1 1 1 34 1 2 3 1 1 2 4 1 2 44 1 1 3 1 1 2 3 1 5 6 1 9 57 1 1 1 4 1 2 7 1 1 1 3 4 5 6 15 16 1 1 3 1 2 3 1 24 1 1 84 1 2 1 1 3 6 7 8 1 1 2 3 4 6 1 1 1 2 103 1 1 1 3 4 5 1 1 9 10 1 12 1 1 3 1 5 6 19 1 1 3 1 2 3 1 1 6 1 2 12 1 2 1 4 1 1 1 8 1 1 1 2 25 1 2 3 1 1 1 1 2 1 2 6 8 1 2 3 1 14 1 2 3 65 1 2 1 1 3 1 1 8 1 2 11 12 1 1 3 4 1 1 3 4 1 6 1 1 1 14 1 2 1 4 1 6 1 2 9 1 1 3 1 1 3 1 1 9 1 2 3 1 2 3 7 1 295 1 2 1 2 1 2 3 1 5 8 1 1 13 1 1 3 1 2 1 2 5 6 1 1 12 1 14 1 2 1 4 1 6 1 1 3 1 11 1 1 2 3 1 1 18 1 1 3 4 37 1 2 1 2 1 1 44 1 1 3 4 5 50 1 2 1 1 2 4 7 1 2 1 2 1 2 5 1 2 3 1 2 3 4…

Example 2:

Input: 3197 272098676 218786837 152349105 218569558 364877863 820982447 957853428 110765313 919347304 839882442 587779694 148726048 485763391 850992031 915026857 696132113 513573347 925268505 447418045 268216786 595968907 821257152 676341982 929446298 746379629 90745138 503189014 164122467 85901060 154609108 602100375 115823207 812455315 715072432 672805526 980062592 786805482 365546024 453727246 203819230 984960989 898634318 308953307 872253729 725337613 704177210 580854414 812594977 438556501 289121660 250746440 728440932 651790316 74812831 78557104 19953517 198610733 79403509 571725236 402253369 876138211 279334732 67794890 54707010 500788043 264224010 147620758 636845290 604158518 416172178 399272386 381336346 938531082 288198251 131273926 588882689 816294939 672148618 435901680 348925024 603…
Output: 1 1 1 2 5 6 7 1 2 1 1 1 2 5 6 1 1 11 1 1 3 4 1 17 1 1 2 1 1 2 6 1 9 1 1 36 1 1 2 1 41 1 1 2 1 1 1 4 1 1 1 4 1 1 2 1 4 1 6 1 19 1 1 1 4 1 1 7 1 1 1 1 32 1 1 3 4 1 1 1 1 4 42 1 2 1 46 1 2 1 1 2 1 1 5 1 2 9 1 2 1 13 1 1 2 19 1 1 2 1 2 3 1 7 9 1 11 1 2 14 1 1 2 1 4 1 1 1 2 5 1 91 1 2 3 1 2 1 2 5 1 2 3 12 1 1 3 1 1 2 1 2 3 1 1 3 1 1 2 4 1 2 10 1 165 1 1 2 1 5 1 1 2 4 1 2 1 1 2 1 2 1 2 8 1 2 3 1 1 190 1 1 1 1 5 1 1 3 4 1 6 1 8 1 2 1 4 5 1 1 2 1 4 1 6 7 1 1 16 1 1 2 4 21 22 1 2 1 39 1 2 1 1 3 1 7 1 1 3 1 2 1 1 8 1 1 2 1 20 1 1 3 1 2 1 1 2 1 5 1 1 3 1 2 1 2 1 4 1 2 7 18 24 1 2 1 2 1 1 2 1 4 8 1 10 1 2 1 1 3 101 1 2 1 2 1 1 5 1 1 10 11 1 2 1 4 1 6 1 8 1 2 1 12 1 2 3 4 1 1 3 1 2 3 1 5 1 2 3 12 1 1 3 1 2 1 2 3 4 5 1 7 1 1 3 16 1 2 1 2 1 2 3 6 1 1 66 1 1 2 3 5 1 2 3 4 10 1 1 13 1 2 1 374 1 1 2 1 5 1 7…

Example 3:

Input: 600 106379032 289860133 217176621 493911781 886296761 462138529 709712865 704790402 463170895 262937895 237992991 154976784 968988324 623650071 178402400 274093787 757312593 117846618 393707567 658645561 359201381 403660795 225358953 866932166 899127807 557964417 298870957 653206565 923058974 3337834 631305768 551863362 663487236 655744222 935975347 965764097 386124641 219658098 120888316 684047006 459147850 825165835 331818886 803436612 994099769 660700835 356536229 798661235 425204896 350501215 633204678 733386336 749265588 447714506 40041926 6724970 740946599 366817094 472092093 726440193 21286958 388142550 618987393 327937552 461473820 121507172 168037912 863706486 583004611 934554278 669382355 967040291 110828217 118937899 171855467 280275700 42203197 733989928 793632262 349439800 869…
Output: 1 2 1 4 5 1 2 1 1 1 1 1 13 1 1 2 4 1 2 3 1 2 1 11 12 1 1 3 16 1 2 1 4 1 22 23 1 1 1 4 1 6 1 2 45 1 1 3 1 1 3 4 5 1 1 1 4 1 2 3 1 2 3 1 2 1 2 23 1 25 1 27 1 2 3 4 1 6 7 1 9 37 1 1 1 1 3 6 1 1 9 1 1 2 1 5 1 1 3 1 2 1 2 5 6 1 1 3 1 11 1 2 1 1 1 20 1 2 1 1 2 3 1 2 1 1 5 1 2 12 1 1 2 3 1 18 1 2 3 1 1 26 1 1 1 4 1 2 1 2 1 2 1 1 13 1 75 1 1 1 3 1 5 6 1 2 1 4 1 2 1 4 16 1 1 2 4 1 179 1 2 3 1 2 3 4 8 1 1 3 1 1 1 2 5 17 1 1 3 1 2 1 2 5 1 2 3 1 1 1 3 1 1 2 1 9 1 2 1 1 3 1 1 2 1 1 23 24 1 1 2 4 1 30 1 1 1 4 1 6 1 43 1 2 3 1 1 3 1 1 9 1 2 3 4 1 1 62 1 64 65 1 2 3 1 2 1 2 3 6 7 1 12 1 2 3 1 2 3 19 1 2 1 1 5 1 1 8 1 1 2 1 2 1 34 1 2 3 4 1 2 1 1 9 1 2 1 13 1 1 3 1 5 1 1 1 1 57 1 1 1 1 5 1 7 1 1 3 1 2 1 1 2 1 2 6 12 13 1 2 1 1 2 1 2 8 9 30 1 1 3 4 1 6 1 2 3 4 1 1 3 4 1 1 1 1 19 1 1 1 4 1 2 1 1 2 10 1 1 13 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Keeper's Jade Ledger - MEDIUM Coding Problem | CodeTikki