CT49148

Archivist's Streak Back Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the granite steps of Stonehallow as Archivist unrolls the day's manifest of ledgers. The tally will decide the next shipment. 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: 3974 887050147 744236403 574910163 915159532 705844625 908136115 733195426 736184201 226679508 725859646 377482916 858784306 269636965 535640036 235767987 85704575 932213843 470101999 766194817 915495287 820575449 932044297 271758541 940423928 332351596 549105513 644973345 989546153 536214606 206303829 494615665 759068941 753657163 70260606 528328018 821006537 44647866 42124913 328589912 139519488 312863952 407531973 373919571 544193461 570617924 381893827 721538175 833211261 732064491 40153333 314387049 714791030 664713184 600885463 789670458 175459700 752543699 970501066 127122355 70479745 689643934 387942749 334557932 766740978 92280421 42417790 961172726 269095554 669690090 151780693 54362635 171512243 647625696 77350797 897364599 25909803 443668950 865171978 74642182 738110038 6431075…
Output: 1 1 1 4 1 2 1 2 1 2 1 6 1 2 1 1 17 1 2 3 1 5 1 24 1 2 3 28 1 1 2 4 1 1 2 8 1 1 3 1 2 6 1 8 9 1 11 20 1 1 2 3 1 1 7 1 2 30 1 1 3 1 1 6 1 1 9 1 2 1 1 3 4 1 8 1 2 3 1 2 1 1 16 1 2 3 1 5 1 2 1 1 2 3 1 1 7 1 2 1 1 2 6 7 22 1 1 1 26 1 1 29 1 31 1 2 1 1 3 1 7 1 2 1 11 1 1 3 1 2 64 1 2 1 4 5 1 7 1 112 1 2 1 4 1 6 1 2 1 2 5 1 1 2 3 5 1 7 13 20 1 2 3 1 2 6 1 1 1 2 1 2 1 4 9 1 1 2 19 1 2 3 1 1 2 4 1 2 1 4 5 1 33 1 1 2 4 1 2 3 1 1 1 11 12 46 1 2 1 1 5 1 1 2 1 2 6 1 1 14 15 1 2 3 4 1 2 3 1 1 2 11 1 1 2 3 1 6 1 19 1 1 1 1 1 4 7 1 2 1 2 1 47 1 2 1 2 1 2 1 6 9 10 1 1 3 1 2 241 1 1 3 1 5 1 2 1 4 5 1 12 1 2 3 4 1 1 2 1 4 5 1 8 1 10 1 2 1 2 1 1 17 1 1 1 21 1 1 3 1 1 2 4 5 1 1 8 1 1 3 52 1 1 3 4 5 1 1 8 330 1 1 3 1 2 1 1 3 4 7 8 1 2 3 1 13 1 2 1 1 3 1 23 24 1 2 1 2 5 1 1 2 1 2 1 4 5 6 7 16 1 2 3 1 2 1 4 1 9 1…

Example 2:

Input: 2916 37897750 183356616 540854457 595566730 521860064 562183307 243074306 878342888 492925769 61583820 970806089 776282229 443648154 85248628 933848149 517489261 646851691 262011470 276766910 339081935 25056935 540018541 772039474 484592489 970942623 482516932 301908015 619055347 846125341 551400047 310812593 847709375 24559191 510796186 477746869 912183398 665288825 419530308 449275180 510081419 132137254 659164826 687908219 367245045 155448377 801907549 82388363 671951433 615246797 891299590 105360142 533182665 856794050 586523353 473465693 480617271 875358551 578435591 650640858 544761127 348908573 571241532 216698327 381495524 283165040 855962812 20227489 604532881 361415344 785449741 760229515 755664184 591406888 274765366 473806359 505183435 229139915 517392300 170115661 167827374 23…
Output: 1 2 3 4 1 2 1 8 1 1 11 1 1 1 4 1 2 1 2 3 1 5 8 1 25 1 1 3 4 1 1 7 1 2 1 11 1 1 2 3 1 5 7 1 1 10 1 2 1 14 1 2 3 1 1 2 7 1 2 1 1 3 1 2 1 9 1 2 1 4 1 1 1 1 2 3 1 5 1 1 3 10 17 1 2 1 2 63 1 1 3 1 1 3 4 5 1 1 8 1 13 1 1 1 105 1 1 3 1 2 1 2 1 1 3 1 5 1 7 1 1 10 15 1 1 1 1 2 4 22 1 1 3 29 1 2 1 1 5 1 1 3 4 1 1 1 13 1 2 1 2 3 1 1 8 1 2 1 4 13 1 2 3 30 1 2 1 1 1 4 5 1 1 1 3 1 11 1 1 1 4 1 2 1 4 1 6 11 1 1 25 26 1 2 29 1 2 1 2 1 1 7 1 2 10 42 1 1 1 3 1 1 6 1 2 1 2 3 4 1 2 1 8 1 19 1 2 3 1 2 3 1 2 3 4 1 1 1 11 76 1 2 1 1 5 1 113 1 2 1 2 1 1 2 1 4 1 1 3 11 12 1 2 17 1 2 1 2 3 4 1 138 1 1 3 1 1 2 4 1 1 3 1 9 1 1 15 1 2 1 2 20 1 2 1 4 1 1 7 1 2 3 1 2 1 2 5 1 2 1 4 10 1 1 2 1 1 1 17 1 1 1 4 1 1 2 4 1 2 1 8 1 1 42 201 1 2 1 2 3 1 2 1 7 1 1 3 4 1 2 1 2 1 1 20 1 2 3 1 1 2 3 1 5 1 1 1 2 10 1 1 1 18 1 2 1 1 3…

Example 3:

Input: 792 343454104 458849796 332591936 119775696 578897580 99606536 108643962 369932616 296743413 826519690 692393036 930439214 504547105 624834171 341970515 103208891 355845381 536994410 395288995 113633106 943432559 33372865 230280402 220014359 583158951 6002415 156788704 365724202 989499092 714420701 69542568 405340658 57364856 948672861 445335601 501136663 558315398 303611764 240633439 468152460 366460903 692046805 535855940 397164741 813399921 403794071 871585069 765338166 565470875 38010025 125764031 112698045 297374902 301081390 564358702 886434512 633605965 531922936 531378531 465320095 519357400 977487123 854924686 902874927 587497813 369732117 152727608 849830893 464754071 898224537 439991940 492055140 379994262 9007414 820960701 413909411 365365671 552566083 613871732 319041668 19267…
Output: 1 2 1 1 5 1 2 3 1 10 1 12 1 2 1 1 3 4 1 1 21 1 2 1 4 1 2 3 29 1 1 2 1 5 1 2 3 1 1 3 1 8 1 1 11 1 13 1 1 1 2 1 4 5 6 22 1 1 1 1 2 33 1 2 1 1 1 4 1 6 1 2 1 1 5 1 1 3 4 1 1 20 1 1 2 1 1 1 3 5 1 2 3 1 1 11 35 1 1 1 2 4 5 1 2 3 1 79 1 2 1 1 5 1 2 8 1 1 2 4 1 1 3 1 2 18 1 1 129 1 1 2 1 2 1 7 137 1 2 1 4 1 2 1 2 1 2 7 1 2 1 4 5 1 1 1 1 3 1 12 1 2 3 1 1 3 7 1 9 33 1 2 1 2 1 2 1 1 2 6 1 1 2 1 2 5 1 7 1 1 2 1 19 1 2 24 1 1 3 4 5 1 1 2 1 1 11 36 1 1 39 1 1 2 1 4 1 2 3 48 1 2 53 1 1 1 1 1 3 1 94 1 2 1 2 1 1 3 6 1 1 3 10 1 14 1 16 1 2 3 4 1 2 3 8 1 2 3 4 1 1 7 1 2 1 1 1 6 1 2 1 10 1 2 1 14 1 31 1 1 2 4 1 2 1 8 1 10 1 1 13 1 2 3 1 2 1 4 1 9 1 1 3 1 1 1 2 8 1 2 1 2 3 6 37 1 86 1 2 1 2 1 1 2 1 9 1 2 12 1 1 1 4 1 6 1 2 1 4 1 1 1 4 1 1 209 1 1 3 4 1 2 7 1 2 1 1 1 4 1 8 16 1 1 3 4 1 1 1 1 1 2 4 12 1 239 1 2 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.