CT35330

Wynne's Ledger of marks

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the marble forum of Argentium with crates of marks, and Wynne the chronicler must account for every last one. 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: 768 148133457 576821234 522039449 532618188 534946702 446777632 908445182 731848152 892315480 662331598 182238840 575549120 137000108 25262426 685143836 466514325 975940893 364227225 932138821 869026765 153981947 871443378 177037149 862608340 781710394 123568783 13960538 871546793 429351164 692600929 345521644 65474921 912052778 832498600 627762414 139952715 895442977 349622991 953792061 345462048 593863786 672443470 200134108 438308298 483043787 951051718 302692822 438150285 477370302 407806844 991432534 335830704 349450076 550574251 228177134 659411191 237390495 798893412 240494311 156690709 548708665 804002745 423661387 288822583 694136133 517790249 122991769 805406227 822663424 729984146 958076560 949784332 18685793 867900062 296594594 588365840 112330310 242681232 323183553 223721695 …
Output: 1 2 1 2 3 1 7 1 2 1 1 2 1 1 6 1 17 1 2 1 1 3 1 2 1 1 1 9 1 2 1 1 14 1 1 1 4 1 22 1 2 3 1 2 3 7 1 2 3 1 51 1 2 3 1 5 1 7 1 1 3 11 1 1 3 1 1 17 18 1 20 1 1 2 1 2 1 2 3 1 9 1 1 2 1 1 2 6 1 1 10 1 21 1 1 3 1 1 2 4 5 6 1 1 12 1 2 1 1 2 1 7 1 2 3 1 5 1 1 2 16 50 72 1 1 3 1 128 1 1 3 1 2 1 1 1 1 3 6 1 2 1 2 1 2 5 1 1 3 1 23 1 2 3 4 1 1 2 1 1 2 3 35 1 2 3 1 1 6 1 8 172 1 1 1 3 1 2 1 1 1 2 4 8 1 2 1 15 1 1 3 20 1 1 1 2 3 5 6 28 1 1 3 4 33 1 1 1 1 1 2 5 7 1 1 11 1 2 3 4 1 1 3 1 5 1 7 12 1 2 59 1 1 1 2 1 5 1 2 1 4 5 11 1 2 15 1 2 3 1 1 2 22 1 2 1 1 3 1 1 1 1 4 5 7 13 14 96 1 1 3 1 2 1 1 1 2 5 1 7 1 9 1 1 1 1 3 1 1 6 23 1 2 3 4 1 1 7 1 32 1 2 3 1 2 1 135 1 2 1 2 5 1 2 8 1 2 1 4 1 2 7 1 2 3 1 2 3 1 2 3 4 1 6 10 1 1 1 4 1 26 1 1 1 2 1 1 1 1 2 3 9 12 1 1 1 3 5 1 7 1 1 10 1 2 3 14 1 1 1 3 5 6 1 2 1 4 1 12…

Example 2:

Input: 2790 329944563 46678485 481938406 552380240 187974019 982345234 742899296 41505417 173056857 587569454 86729109 243113034 301365218 486956284 551650965 470496021 773638416 415598863 389679256 216873497 397112876 216699510 146756597 131043647 147381779 640176313 343960838 69068243 387384801 713222233 508640317 674700992 199685468 611810132 252291232 688850310 547094480 639805705 882049097 769548914 714862828 844288988 625681495 717909894 104172783 685160711 59623898 87011461 793698376 660588144 799503770 732446827 877920565 573819612 772039727 462550501 542716864 838848194 824588021 85156411 105023492 979381833 337146209 938342218 838441558 138563455 528726159 873442896 895117875 355259494 283829772 261302902 636653804 945521301 731792061 898211794 358144323 203910135 70289921 774431978 623…
Output: 1 1 3 4 1 6 1 1 2 3 1 2 3 4 5 1 11 1 1 1 3 1 1 1 3 9 1 1 3 13 1 2 1 2 1 6 1 2 33 1 1 3 1 2 1 2 1 2 7 1 9 1 14 1 2 1 2 5 1 1 2 56 1 2 1 1 2 4 5 1 1 1 4 12 1 2 1 1 1 4 1 1 1 10 1 2 1 4 5 6 1 2 9 10 1 12 1 1 3 100 1 2 3 4 1 6 1 8 1 2 1 1 1 3 1 16 1 1 2 1 2 1 6 1 2 9 1 1 2 4 1 1 3 1 35 1 2 1 2 1 2 1 2 1 2 1 1 11 1 1 3 1 1 6 7 1 2 1 4 1 2 7 1 2 3 1 2 1 2 1 1 3 6 1 13 21 1 2 1 1 5 1 1 2 3 4 11 1 1 3 1 57 1 1 3 4 1 2 1 4 1 2 1 2 1 10 1 108 1 2 3 4 1 2 1 8 1 1 3 12 1 2 1 1 5 1 2 1 4 1 2 7 1 1 3 1 1 2 4 1 1 1 4 24 1 2 1 4 1 2 3 1 9 1 2 3 1 2 3 1 2 3 1 11 12 1 2 15 1 1 3 1 2 3 1 5 1 2 3 9 1 1 1 16 1 2 1 4 1 2 1 2 5 41 1 1 1 4 1 2 7 1 1 3 4 1 6 14 1 2 1 2 1 4 1 2 7 10 1 26 1 2 3 1 2 3 1 8 1 2 1 2 5 1 1 3 1 2 6 1 1 3 1 5 1 18 1 20 1 1 1 4 1 101 1 1 1 2 3 1 1 8 1 2 1 1 3 1 2 3 1 1 11 1 1 2 1 1 5 7 1 1 …

Example 3:

Input: 144 364787291 686909274 299970243 418582734 516556981 813343667 682890280 113838005 44099873 94564858 220157882 227496478 897029594 602229473 187775531 313656909 954771151 425041950 96446168 225696592 29146601 41502475 857478698 123548606 127291306 465342410 560433955 140859164 105744110 996552947 766800920 560725675 75822420 957539483 159643610 674106413 45269608 980431496 54789070 878289003 902571330 761720517 795520878 801315883 878387157 288996720 351484199 723032255 260332834 972656497 376111168 357681145 417470704 159634209 531241471 754730363 511589338 623715690 758973692 342928111 825033735 289914659 687969476 394532423 344225022 41045948 38959072 756392764 280605764 235774379 234851020 92991543 691778950 582168478 659679939 180099791 987756153 592930653 906579062 106084370 7823461…
Output: 1 2 1 2 3 6 1 1 1 2 4 5 13 1 1 2 17 1 1 2 1 2 6 1 2 3 4 1 1 30 1 1 1 4 1 2 1 8 1 2 3 1 2 3 4 1 2 3 1 12 1 1 3 1 5 6 1 2 9 1 11 1 2 1 1 1 1 7 1 1 1 1 5 1 2 1 47 1 2 1 2 1 1 5 1 2 1 4 12 13 1 1 1 1 5 6 1 1 1 3 1 6 1 2 15 16 1 1 1 4 5 1 2 3 1 10 27 1 2 1 2 3 1 1 3 1 1 3 1 1 2 1 2 3 7 1 2 1 1 1 1 7 1 1

Constraints:

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

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