CT38236

Baron's registers Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the ivy courts of Vineward, Baron studies rows of registers 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: 411 196711084 279623715 59302230 629000123 931293903 588765412 845904271 663518847 956933002 671379204 210816208 758338996 883172257 206079084 668079797 365479966 387896496 248664827 280746287 753525808 93961503 646212491 52488675 712878716 811343930 471935661 657174726 186445734 304507543 525527006 601977076 375339065 308720773 84062605 711939061 768044201 997338350 893716735 7905018 978967347 545149801 485697333 450838925 168997158 363164976 654854884 677566110 61311260 814505782 818460631 77461171 310029586 174364471 215314423 824919389 738744993 369857589 147114989 397827691 973417386 749368223 550329980 868702680 342798614 580296402 306922608 556132308 263019064 963289289 481598914 831385881 265659145 604777979 293904226 346510574 867992038 164920031 255651875 932588103 218026578 6340…
Output: 1 2 1 4 5 1 2 1 9 1 1 3 4 1 2 1 2 1 2 7 1 2 1 4 12 1 2 1 2 3 4 1 1 1 10 11 37 1 1 3 1 1 1 1 2 6 7 1 9 10 1 2 1 2 15 1 1 1 3 20 1 1 3 1 2 1 2 1 9 1 2 1 2 1 2 7 1 2 10 1 2 45 1 1 3 1 2 3 1 2 54 1 2 1 2 5 1 7 1 1 1 3 1 2 1 2 1 1 7 1 13 1 2 1 4 1 2 1 8 1 23 1 1 1 27 1 2 1 4 5 1 1 35 1 2 1 4 5 1 1 8 1 2 1 1 2 6 1 2 9 18 1 1 3 1 1 2 3 1 1 7 8 1 2 1 166 1 1 2 1 2 5 1 2 3 4 5 1 1 1 4 10 1 12 1 1 3 1 1 3 1 1 26 1 1 1 1 1 4 1 2 3 1 1 12 1 41 1 2 3 1 5 1 7 1 1 2 4 1 2 1 8 1 58 1 2 1 1 2 4 1 1 2 3 1 5 11 1 2 1 1 3 1 5 1 7 10 1 2 1 2 1 16 1 1 1 2 1 6 1 2 36 1 1 2 4 1 2 1 4 1 1 3 4 13 1 2 1 17 1 2 1 4 1 1 3 1 2 1 4 1 13 1 1 3 4 1 2 1 2 1 2 1 1 7 1 11 1 2 1 1 2 3 1 23 1 1 3 1 2 1 1 2 1 7 1 9 1 1 15 1 1 1 1 3 1 111 1 1 3 4 116 1 1 2 1 4 1 2 7 1 2 1 4 1 13 1 2 1 2 1 20 21 1 1 1 3 1 1 6 1 1 1 11 1 2 1 2 5 6…

Example 2:

Input: 2465 460157817 979954070 261157841 422913770 601467696 800579518 581280589 160501022 952748180 499130059 709394684 416131702 825228403 25055506 691693778 976933866 528449581 460613211 832631459 951840448 574581767 646316741 539563813 681972 219884019 908537617 603786094 862806226 274986981 128959577 116070118 507068934 442277046 161855157 143669281 724111327 9057440 578127992 811656112 594028446 37663844 329109418 551423047 256956352 663328604 25682701 311747693 571219795 776571008 343661940 912231954 947495635 694667861 552132136 912340456 615811535 928029977 151615478 393077616 21264 796849321 502527374 566707944 907881283 74265941 933715739 682074464 928679014 60056930 667196940 949662094 509704752 490532428 966394411 40712799 708647334 974629465 424178642 993054252 530266537 275674345 …
Output: 1 2 1 2 3 4 1 1 7 1 2 1 4 1 2 14 1 1 3 4 1 2 1 1 2 6 1 2 1 1 1 4 1 1 1 8 1 2 11 1 1 2 3 1 6 1 2 3 10 1 31 32 1 1 3 1 5 1 2 1 4 1 2 7 1 14 1 2 1 2 51 1 1 58 1 2 61 1 79 1 1 3 4 1 1 7 1 2 1 11 1 1 3 1 2 1 18 1 2 3 1 5 1 25 1 2 3 4 1 2 1 2 1 2 3 1 38 1 2 3 1 2 6 7 8 1 2 1 2 3 6 1 2 1 4 1 6 1 1 2 1 142 1 2 3 4 1 6 1 2 3 1 1 1 1 1 6 1 2 3 1 2 3 1 14 1 1 2 4 1 6 21 1 2 3 4 1 2 1 4 1 1 1 36 1 2 3 4 1 1 7 8 1 52 1 1 2 3 5 1 1 3 1 5 1 7 1 1 2 1 2 3 19 1 1 3 1 2 3 4 1 2 3 4 9 10 1 1 1 2 37 1 2 3 4 5 43 1 2 3 4 1 2 1 4 5 6 1 1 9 1 2 3 1 1 1 115 1 1 3 1 5 1 1 1 3 4 1 1 1 3 1 1 12 1 2 1 16 1 2 3 1 1 3 28 1 2 1 2 5 1 2 1 1 3 1 1 2 1 1 11 1 1 3 20 21 1 1 3 1 2 6 1 8 1 10 1 2 1 320 1 1 1 2 5 1 2 1 9 1 2 1 13 1 2 1 4 18 1 1 2 4 1 2 1 2 1 2 29 30 1 2 3 4 1 1 3 1 1 3 1 2 1 14 1 1 3 1 1 6 1 8 1 2 1 4 1 2 1 8 …

Example 3:

Input: 2249 794118060 866248860 280015213 357806076 800258454 799837057 821107889 984103913 623222202 178950672 366848621 923246710 695035161 124241590 371096542 696848560 157935604 750636930 714405261 71805911 108569863 784725266 278472387 322034016 252148846 579576572 28217995 375887945 221766816 451703889 228622717 753543885 459068986 52500798 911952844 899279585 725487495 348922309 85070413 313870278 931021006 578010062 877303639 671209054 886962461 589316388 57761102 163561641 339325068 509875808 306050670 868386075 869433079 595078919 794310685 370959485 50900884 834870795 179869483 328640496 956726412 710497641 992102280 487610065 200070388 386039242 676418028 357221412 311711653 561191955 39731972 211820962 667564777 23947942 254088642 709240811 903882816 586532909 480833044 169859196 528…
Output: 1 2 1 2 3 1 5 8 1 1 2 4 1 1 2 4 1 6 1 1 2 10 1 2 1 4 1 2 1 4 1 10 1 1 23 1 1 1 1 2 33 1 2 1 4 1 1 2 3 4 1 7 8 1 2 1 1 5 1 2 53 1 63 1 1 2 4 1 1 3 1 2 6 1 2 13 14 1 1 1 3 5 6 1 2 1 1 2 3 13 1 1 3 1 1 1 34 1 1 3 1 2 3 41 1 2 1 2 5 1 2 3 1 1 3 12 1 1 1 2 1 6 7 1 1 2 1 1 2 1 5 1 1 3 9 1 1 75 1 2 1 1 1 144 1 2 3 1 5 1 7 1 1 2 1 1 6 1 1 1 2 11 12 1 1 1 23 1 1 1 4 1 1 3 1 9 1 2 1 2 5 1 2 3 1 5 20 1 2 1 1 3 26 1 1 1 197 1 2 3 1 5 1 2 3 1 2 11 1 1 1 4 1 2 3 1 20 1 1 3 1 2 1 4 1 2 30 1 2 1 2 5 1 7 1 2 1 11 1 2 1 4 5 1 7 1 2 10 1 1 24 1 2 3 1 2 1 2 1 2 5 1 36 1 2 1 2 3 1 7 1 1 2 4 1 1 7 1 9 1 2 12 1 2 22 1 1 3 26 1 1 29 1 1 3 1 1 3 1 5 1 1 1 77 1 2 1 1 5 6 1 2 3 1 5 1 2 3 1 2 1 1 19 324 1 1 3 4 1 2 1 1 9 1 1 1 1 3 1 5 7 18 1 2 3 1 2 3 1 2 6 1 1 9 1 1 2 3 17 1 19 1 2 1 2 1 1 1 8 1 2 3 1 2 1 4 1 2 7 1 …

Constraints:

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

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