CT46274

Vera's Ledger of ledgers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the otter slides of Sleekwater as Vera 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: 1338 998054902 990037459 908380906 903836390 188095061 502956523 292689805 526032902 717447027 314172895 934274294 268801501 204157660 261524043 982468740 272022329 201146991 754861233 137096129 891223547 101942185 741578239 11076918 504949176 183602316 544277573 572106060 96011486 585353677 665483742 98396530 178926436 138350381 864229216 419696995 211656405 354872380 601745593 194741779 323918128 197302619 769843688 932255310 486578893 394682158 413194472 965010951 588273809 978942331 456172149 979255778 371879027 591889073 575746657 871810128 366434847 626283429 839764800 816915916 469475735 142136783 274947357 863110299 990151467 355142524 266952108 410141614 394948148 513225047 412445183 99083538 332990807 353317535 117214389 426509087 284121882 848873001 43425245 127821635 913115860 …
Output: 1 1 1 1 1 2 1 4 5 1 9 1 1 2 13 1 1 3 1 5 1 2 1 2 1 4 5 1 7 8 1 2 1 14 1 1 2 4 1 2 1 8 28 1 1 2 32 1 34 1 36 1 2 1 4 1 2 3 1 1 1 2 8 63 1 1 3 1 5 1 1 2 3 1 6 1 13 1 2 16 1 2 3 1 1 1 4 1 1 1 8 12 1 2 3 4 1 1 35 1 2 3 1 1 2 1 1 1 10 1 2 1 49 1 2 1 4 1 1 2 1 2 1 2 3 6 1 2 3 17 1 1 20 1 1 72 1 1 1 4 1 1 1 3 9 1 1 3 1 1 2 4 8 1 10 1 1 1 1 5 1 2 3 1 1 3 7 1 9 1 1 1 3 1 1 175 1 2 3 1 2 1 1 8 1 2 11 1 1 3 4 1 2 1 4 1 2 3 1 5 1 1 2 4 1 1 3 1 5 1 1 1 1 3 5 12 1 14 1 2 30 1 1 1 38 1 1 1 1 3 6 56 1 58 1 2 3 1 1 2 1 1 1 6 1 2 1 1 2 1 7 1 9 1 1 2 1 14 15 22 1 2 3 1 2 29 1 2 1 1 2 1 5 1 7 1 1 41 103 1 1 3 4 1 1 2 4 9 1 1 3 4 1 2 1 4 9 1 1 1 22 1 1 1 4 1 1 2 3 1 1 6 1 2 9 10 1 13 1 2 1 2 3 23 1 1 26 1 28 1 2 1 4 1 34 1 2 59 1 2 1 2 5 1 2 3 4 1 2 1 72 1 1 2 4 5 1 2 1 2 3 1 1 1 2 5 9 10 1 1 1 4 1 1 3 1 2 1 1…

Example 2:

Input: 3151 231632884 225308667 26018362 897144715 60100300 507453249 813545091 198086577 817552435 455975369 481405190 913941888 410527505 517728977 402066889 52680005 916727047 816989641 904341416 682786680 79854549 29906271 219432370 140105405 993621078 623649278 647593646 842066829 263423525 756176178 660693552 458758035 407443587 494437171 716050880 26783366 706974786 28691559 289552826 474922626 391949267 562752965 39903466 930710631 12525708 229871993 961663454 990288514 369162612 296391221 389134631 271749165 900875536 389080 793360457 678608540 365371125 3426578 748946555 36232063 389463520 839040603 747388425 736715686 681069773 748662852 999303956 440556026 329138618 715630232 519838131 71438782 533449052 134347874 361896102 93040445 281530510 482924052 968353160 655913405 738645360 69…
Output: 1 1 1 4 1 2 3 1 5 1 2 12 1 2 1 1 17 1 2 1 1 1 3 1 25 1 2 3 1 2 1 1 1 3 5 1 2 1 2 3 1 5 1 19 1 2 22 23 1 1 3 1 5 1 2 1 1 1 4 1 2 9 1 1 1 4 67 1 1 3 1 1 3 1 2 1 2 5 12 1 2 1 1 2 18 1 2 1 2 1 2 1 1 3 6 1 1 3 1 1 3 7 1 1 3 1 2 19 1 1 1 3 1 2 3 1 30 33 1 1 2 4 1 2 1 2 1 4 1 1 3 1 9 1 11 1 15 20 1 1 1 24 1 1 3 4 1 1 1 3 1 1 6 1 2 10 1 1 17 1 1 3 1 5 6 24 1 1 2 4 53 1 1 56 1 2 3 1 2 1 4 5 1 10 1 2 3 4 5 6 1 2 3 1 1 3 1 14 1 2 116 1 2 1 1 5 1 2 1 4 1 1 2 1 14 1 2 1 4 1 6 7 8 1 2 1 2 3 14 1 1 1 4 5 1 2 3 9 1 11 1 2 3 4 1 2 1 2 3 1 166 1 2 1 2 3 1 5 8 1 1 1 4 13 14 1 1 2 3 4 5 1 2 23 1 1 1 4 1 2 1 1 1 1 2 1 9 203 1 2 1 1 3 4 5 1 2 8 1 2 1 4 1 2 3 18 1 2 1 1 3 4 1 2 3 8 1 1 2 1 33 1 1 3 1 2 1 2 1 2 3 1 5 1 2 3 1 2 1 1 1 4 10 1 24 1 26 1 28 1 2 1 4 5 1 1 1 3 5 1 1 2 1 5 1 2 3 9 1 2 1 4 1 53 1 2 1 2 5 …

Example 3:

Input: 3527 773964828 696044232 759560953 216193120 685854355 550215918 542346015 390472709 951345142 634592406 580907008 133093870 453987739 890958360 713152186 686792694 365391877 145188597 800630261 841464690 743288725 438105047 69747681 515513925 413336285 807481477 43365924 431728832 771741014 579231185 979833065 626533261 629230108 642328360 892687583 777758063 931748210 328318155 166393418 34763803 933136878 790252916 372671307 191719639 744410085 993914628 641033488 336311439 299501101 32315237 830116612 416406447 204889899 524337889 983122704 533163692 81033232 238758065 39916675 946619809 279465934 501075116 87546526 295706992 473911782 511925566 221837903 765833232 313287687 54823938 21088238 49827423 882610158 863778531 818816041 808270506 679812510 209843722 446047863 431314711 76494…
Output: 1 1 2 1 2 1 1 1 9 1 1 1 2 5 1 1 1 1 5 6 1 1 1 3 1 6 1 2 3 1 31 1 2 3 4 1 6 1 1 1 10 1 1 1 3 46 1 1 1 1 5 1 1 3 9 1 1 2 1 5 1 2 1 2 3 6 1 8 1 1 1 2 13 1 1 1 1 1 2 1 5 1 1 24 30 1 2 1 1 2 1 2 1 4 1 1 3 8 1 2 13 1 2 3 20 1 2 1 1 1 1 1 2 4 1 1 1 2 4 1 7 1 1 3 4 12 1 2 3 45 1 2 1 4 1 6 1 2 1 2 11 1 1 14 1 1 1 4 19 1 2 1 4 1 2 1 2 3 4 1 6 1 10 1 2 1 2 3 4 1 1 3 1 5 1 13 1 1 1 1 1 5 1 1 1 2 1 1 1 2 5 15 1 17 1 1 3 4 22 1 1 3 1 2 3 4 1 1 1 3 5 1 2 8 1 1 87 1 2 3 1 2 168 1 1 1 4 5 1 1 1 3 1 1 2 13 1 2 3 1 1 3 1 5 1 2 3 4 249 1 1 1 3 1 6 1 2 1 1 1 1 7 1 1 3 1 2 13 1 1 3 1 5 1 1 1 4 1 2 7 1 2 3 4 1 1 1 2 4 6 1 2 3 1 2 1 4 1 1 20 1 1 1 1 3 33 1 1 3 4 1 1 2 1 4 1 2 3 1 5 11 1 17 1 1 1 3 22 1 2 1 4 27 1 1 1 1 4 5 1 8 1 1 3 1 5 1 1 2 1 4 1 1 13 1 2 1 2 1 19 1 1 1 23 1 366 1 1 3 4 1 2 3 4 1 6 1 2 3 1 1 1 …

Constraints:

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

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