CT47598

The Streak Back of the Woven marks

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the opal reefs of Shimmerdeep, Shepherd studies rows of marks entries. One clean number will settle the guild's oldest argument. 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: 168 633345540 218015623 436292594 677609064 186659162 710230491 586194615 768524407 257097270 421561453 470418086 10745443 54353757 97347523 345644333 462926805 230338061 802184182 768882355 867976873 923153610 810646861 560435833 890172487 736994221 789426946 910811250 700093396 412902716 90814001 324253483 151793438 707783981 275467070 862898935 197880831 305342145 624814559 373359325 431892442 651123546 553842698 741424367 499403939 693808714 392473021 748222823 103407976 390358721 287654191 289141124 564301215 276519849 618274813 883427474 131519447 997212648 172807796 828407721 714671747 180988182 424664638 846007489 745290664 547006381 733929732 868125929 175128188 950155272 354785824 597460533 681616944 706465439 354153991 173366053 276667009 634019694 374325317 645546316 291869595 …
Output: 1 1 2 4 1 6 1 8 1 2 3 1 2 3 4 5 1 18 1 20 21 1 1 3 1 2 6 1 1 1 2 1 6 1 8 1 2 3 1 2 6 1 8 1 2 1 12 1 2 1 2 5 1 7 28 1 57 1 2 1 1 2 6 1 1 2 10 1 12 1 2 3 4 1 1 2 4 1 6 1 2 3 14 1 1 3 1 19 1 2 34 1 2 3 1 2 3 1 5 6 1 8 1 1 3 106 1 1 1 1 4 5 1 2 1 9 1 1 2 1 4 16 1 2 3 1 2 1 23 1 2 1 4 1 6 1 2 1 2 1 6 13 14 1 1 17 1 1 3 4 1 2 1 48 1 2 1 2 5 1 1 1 2 4 11 1 2 1

Example 2:

Input: 1153 428692021 562248879 609921594 254634848 600331476 766579614 18845850 946507248 449987871 998875161 32145520 345620770 22910008 271971049 939257762 255371281 546819197 96427997 134010340 108885155 53318143 444523590 157544103 398453712 143331430 839919210 476083064 981924796 383182748 476485167 462108171 604728769 420227404 973338049 50804871 266260615 154404691 502386498 269524590 821058422 457386612 641038462 876194535 508533440 484336856 266272553 894552609 44461608 338791060 640583774 92862168 178529009 583422033 993695194 355605203 19584240 632121039 417074527 847621657 95780757 46269784 153406709 12385930 138482812 538655123 909826327 729715441 22001946 110123018 288018497 12467484 458686934 583497208 538775308 467562595 390002952 236425360 754197716 342596334 62002200 271411814 …
Output: 1 2 3 1 2 6 1 8 1 10 1 2 1 2 5 1 2 1 2 1 1 5 1 2 1 11 1 18 1 2 1 4 1 6 1 2 1 4 1 6 1 2 9 1 1 1 13 1 2 3 1 2 3 44 1 1 3 1 5 1 1 3 1 2 6 12 1 1 2 3 1 5 6 1 1 1 1 12 1 1 2 28 1 2 31 1 1 3 1 1 1 2 1 1 2 4 12 1 1 2 1 17 1 50 1 2 3 1 2 3 1 2 1 4 1 2 1 4 15 1 2 1 4 1 2 1 1 2 10 11 1 1 2 1 2 3 1 8 1 10 1 2 1 2 1 1 5 1 2 8 11 1 2 3 1 2 17 1 1 3 1 1 33 1 2 3 1 1 3 4 5 1 2 1 4 72 1 1 3 1 2 6 1 1 2 1 1 12 1 2 1 1 2 1 5 8 1 1 2 1 1 6 7 1 1 3 4 1 2 1 4 16 17 1 2 40 1 2 1 1 3 4 1 2 1 1 5 1 1 1 55 1 2 1 1 1 4 5 1 2 1 2 3 1 12 1 1 2 3 4 1 7 1 2 1 1 12 1 2 1 4 1 2 3 255 1 1 3 1 5 1 2 1 1 1 2 12 1 1 2 4 1 2 19 1 1 2 1 5 1 2 8 1 1 3 12 13 14 1 1 3 1 1 2 1 5 1 1 2 4 27 1 1 1 3 5 6 1 1 1 4 1 1 13 1 1 16 1 1 19 1 21 1 2 1 2 1 2 3 1 5 1 1 12 1 2 1 1 1 3 1 41 1 43 1 2 1 2 1 4 1 1 3 1 1 1 3 5 9 1 1 2 3 1 5 1 1 3 1 …

Example 3:

Input: 3529 486935656 311892866 51136247 695775328 378595762 608430215 270829202 721452841 2496061 966018880 406926861 721252679 765628177 238015713 859142691 719583166 843384993 105454447 128294716 866832087 514819754 983258743 121725496 192289977 415494535 21525703 775335633 32610 435747649 144992864 920579580 387875355 810958806 150312459 598686900 174454005 827477260 432525220 397724573 732720942 504647773 895415620 573647000 67568924 563426949 841848698 70755602 245723318 370577236 609875958 280387992 234810563 132850278 440676955 997527139 237660985 796511616 694944362 892126537 454843994 534673172 534369304 972475192 538217566 670550037 77812859 578586279 860600279 371108662 323154281 854344960 173058050 850865693 955655876 910446918 364135883 356281666 907300613 76337207 496111164 1970981…
Output: 1 1 1 4 1 2 1 8 1 10 1 2 3 1 5 1 2 1 2 10 1 22 1 2 3 1 5 1 2 1 9 1 2 1 2 1 6 1 1 3 1 11 1 1 2 4 1 2 3 4 1 1 1 4 55 1 2 1 4 1 2 1 8 1 2 1 2 5 1 1 3 1 2 11 1 1 1 3 1 2 1 2 1 29 85 1 2 1 1 1 4 7 1 1 3 1 2 3 1 2 6 1 2 3 4 1 12 13 1 2 1 4 1 1 3 4 1 1 3 4 36 1 1 1 1 2 1 4 6 1 9 1 1 3 4 1 1 7 1 1 3 11 1 1 14 1 1 3 27 1 1 30 1 2 1 4 1 6 1 39 1 1 3 1 2 1 1 3 1 10 1 1 1 2 90 1 1 1 1 3 1 5 1 1 1 1 12 1 2 3 191 1 2 1 1 2 4 7 1 1 3 4 1 1 14 1 2 1 1 3 20 1 1 2 1 5 1 1 2 1 1 3 12 1 1 3 1 2 3 7 1 2 1 4 1 1 3 1 1 6 1 2 13 1 2 35 1 1 1 4 1 2 1 4 5 1 2 1 13 1 2 1 1 1 2 4 1 1 23 1 2 1 4 1 1 7 1 1 1 4 1 6 1 1 94 1 1 2 1 5 1 1 2 103 1 2 1 4 1 6 1 1 3 1 1 2 1 14 1 1 1 1 2 1 5 22 1 1 3 4 1 2 1 2 1 6 1 1 3 1 15 1 2 3 4 1 1 2 1 9 1 1 12 1 1 52 1 2 1 1 1 3 1 1 3 1 63 1 1 3 4 1 6 1 1 3 1 5 1 2 3 1 2 1 1 1 3 7 1 2 1 2…

Constraints:

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

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