CT53027

Petr's Wild Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the singing sands of Echo Dunes; Petr weighs the day's ledgers manifests and starts the calculations. 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: 3908 877972543 275218313 34148795 824651177 384328606 59945696 312454814 80456346 657982790 265793714 252420186 444202979 943866606 533708871 600590142 692390081 667072002 607147204 956270227 150274461 680097511 189096638 691455438 659782114 577296782 237056034 295518534 619690177 611690951 936262604 359891008 364939410 561638118 959581345 184102802 15427016 410322854 236927748 794322070 450969954 619885694 194259983 70108490 350321807 913812489 415959837 700762622 293915029 351579011 270568027 153312130 772385157 581374778 430314804 186614486 485569080 445161071 882630395 201398596 163161725 461157720 749461738 649092837 590852434 896687769 200565551 624541450 258883985 81175868 805616964 612495105 688376553 321469495 34546265 548458067 787177795 559135926 707625574 265053785 381819951 97…
Output: 1 1 1 3 1 1 2 1 5 1 1 3 13 1 2 3 1 1 19 1 2 1 4 1 1 1 2 4 1 11 1 2 3 34 1 1 3 1 5 1 2 1 1 3 11 1 2 1 2 1 1 7 1 1 1 3 1 13 1 1 3 4 1 1 20 1 2 1 1 5 1 2 1 1 3 6 1 2 1 2 1 6 7 84 1 2 1 2 1 2 7 1 1 10 1 1 2 1 5 1 2 1 19 1 2 1 4 1 2 3 4 5 1 7 1 2 3 4 12 1 2 3 4 1 2 3 8 1 2 27 1 1 2 4 51 1 1 3 4 1 1 3 8 1 2 1 1 2 3 5 1 2 10 11 1 2 1 1 1 17 1 1 3 1 2 1 7 1 2 1 4 5 1 2 1 2 34 1 1 2 3 1 2 1 7 1 2 1 2 1 2 15 1 1 2 4 1 114 1 1 2 1 1 5 1 2 3 4 1 1 3 14 1 2 1 2 3 4 5 1 7 1 1 2 4 1 1 1 3 1 5 1 7 9 14 24 1 1 3 42 1 2 1 1 1 3 4 6 1 2 1 1 2 1 2 5 17 1 1 2 4 1 2 1 1 2 4 1 6 7 1 1 2 17 1 1 2 1 1 2 3 5 6 7 1 29 1 2 3 1 2 3 4 1 1 56 1 1 3 1 2 302 1 1 1 3 1 1 3 1 1 6 1 2 12 13 1 1 2 4 5 1 2 1 23 1 1 1 4 1 2 7 8 1 2 1 4 1 1 3 4 5 1 1 2 3 5 1 2 1 1 3 16 1 2 19 1 1 3 1 1 1 1 4 40 1 1 2 44 1 1 1 3 374 1 2 3 1 2 3 4…

Example 2:

Input: 2828 585298311 491693822 444429680 217067992 330488081 779897964 246739081 122437078 244694464 123004472 613039040 161682607 519379793 844946540 301284949 123746571 483878611 774485029 844782351 350368395 361652853 665809343 648553170 220143600 834369377 826316637 762800545 173406893 449955615 609685763 164251093 858863182 993289700 223079329 904077130 97124574 600530682 300573589 383425118 595116589 164498574 383596731 231644530 808441514 620829915 882432004 929296668 770112628 15868736 758821955 404472848 554871575 994999919 397070766 878945841 850226427 624380555 111301849 640371832 590235046 361687293 403071235 280387211 11908176 988482284 690706427 655401068 495044011 940938741 703572524 602360401 959756052 133567433 836431940 802611483 395736884 395267289 944438609 358537100 95404451…
Output: 1 1 1 1 2 6 1 1 2 1 5 1 2 14 1 1 3 4 5 1 2 3 1 1 6 1 1 1 2 3 1 32 33 1 2 1 2 1 2 3 1 2 1 9 1 11 14 1 1 2 1 2 53 1 2 1 1 1 3 1 1 2 1 1 12 1 1 1 4 1 1 7 1 2 1 1 1 6 1 8 1 17 1 1 1 4 1 1 24 1 1 2 1 1 5 7 1 9 1 1 2 1 1 15 1 1 2 4 1 1 1 3 1 5 1 2 1 1 10 1 1 2 4 1 2 3 1 1 1 21 42 1 2 3 4 1 6 1 1 3 1 2 1 1 2 4 1 8 1 1 1 2 13 14 1 1 1 1 5 29 1 1 1 2 5 1 2 3 9 1 1 3 1 5 1 1 1 4 1 1 7 1 1 10 1 1 13 28 1 1 1 3 5 1 1 2 4 5 1 1 8 1 2 1 2 3 1 5 49 1 1 1 2 1 6 1 2 1 1 3 4 1 1 3 65 1 2 1 2 3 1 1 3 7 1 11 1 1 3 1 5 1 1 3 9 1 2 12 1 1 26 1 1 2 1 1 2 4 1 2 1 1 9 1 13 1 1 1 3 19 1 1 1 3 5 51 1 1 3 1 5 1 1 3 285 1 2 1 4 290 1 2 1 2 5 1 1 2 9 1 2 3 4 1 6 1 2 1 1 1 3 1 8 9 1 2 1 1 1 3 7 1 2 3 4 5 1 1 2 4 1 1 3 1 2 3 1 33 1 1 3 1 2 6 1 1 2 3 1 5 1 2 1 4 1 1 2 4 1 1 1 3 19 1 1 3 1 2 3 1 2 3 7 8 12 1 2 15 1 17 1 1 …

Example 3:

Input: 581 16731890 770367934 32863040 737107759 84347056 815998288 60482506 1425845 645103766 805808651 697115913 128534488 336464236 472883027 251574980 203301320 740634291 980039837 337197475 798214820 424150458 725170557 597096612 664353337 499206383 95877739 290068505 747764707 915437148 108108420 711847775 914817203 476073766 622181133 181921530 494374736 283592306 924933856 742000997 797378851 686551414 431466452 769097106 353987325 442270960 137333958 727179634 52172492 497084528 864890561 344662191 518774354 992025734 213494805 272973701 939255379 753745044 557347272 38513208 529086249 455841806 86811027 259068308 736034190 663779696 963519612 106092296 393648070 797553197 194885189 963032987 936841365 962021579 560252352 153650134 186290403 529411045 698897012 709445670 174932787 369853…
Output: 1 2 1 2 1 6 1 1 3 4 1 1 2 3 1 1 7 18 1 2 1 2 1 2 1 1 2 8 11 1 2 3 1 2 1 2 1 20 1 2 1 1 3 1 2 1 4 1 2 12 1 2 53 1 2 3 1 1 1 2 1 1 2 7 1 13 1 2 3 1 5 1 2 1 1 2 3 5 6 1 2 3 10 1 1 13 14 35 1 2 3 1 1 2 4 5 1 1 3 9 1 2 1 1 3 1 2 1 7 1 2 12 1 26 1 2 1 2 5 6 1 2 1 1 11 1 13 1 1 1 3 1 2 1 4 5 1 1 2 13 1 2 3 1 2 3 1 1 6 1 11 1 1 2 1 4 1 2 1 4 1 1 7 1 1 2 1 5 42 1 2 3 1 1 61 1 2 1 4 1 2 1 1 1 10 1 1 100 1 1 1 1 3 4 5 1 2 3 1 5 1 1 2 1 5 1 1 1 4 1 1 1 2 14 1 1 217 1 1 2 1 1 2 4 1 2 7 1 11 1 13 1 2 1 1 1 6 1 2 1 2 1 12 13 28 1 2 1 4 1 6 1 1 3 4 1 1 3 1 9 1 2 1 4 1 2 1 2 1 4 7 1 1 1 4 1 2 1 8 1 2 3 1 1 14 1 1 1 2 45 1 2 1 1 5 1 1 2 82 1 1 2 4 1 6 1 1 1 3 5 12 1 1 2 4 1 1 3 102 1 1 2 4 1 2 3 1 1 3 4 1 1 3 11 12 13 1 2 3 1 18 1 1 1 4 1 6 1 8 1 2 29 1 1 3 1 1 1 4 8 1 2 1 2 5 1 7 1 2 3 4 1 2 3 15 24 1 2 1 …

Constraints:

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

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