CT50506

The Pearl marks of Cleo

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Cleo found an old ledger of marks in the workshop attic at the pine barrens of Needlepoint. The margin notes pose a precise question. 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: 1498 725777187 592676989 777820513 788867 826856243 166530485 1127311 36815246 117867496 769814746 323526631 128662156 786880813 32280759 587196236 399912230 796751494 78503463 167414558 644607581 354177384 408312465 320521281 599622322 962371077 693016799 803402233 749513308 157620959 943669159 860493170 934808695 451992353 462813167 864676686 89148701 914569838 865102627 910149479 536075804 230936863 217569015 943450376 595175260 782704222 38140217 395506005 263353931 364839476 241067106 432538189 27478600 826593859 908723999 554996243 946222021 953210534 818262577 345401721 872968432 583545584 706859181 791837809 662297432 70308780 195199052 793088176 778615587 18421485 316239141 711898007 470447378 778845063 97591896 615130378 65329762 364166754 592359916 263327429 534865619 528104705 …
Output: 1 1 3 1 5 1 1 2 3 5 1 1 8 1 2 1 12 1 2 3 1 2 1 4 25 1 2 1 1 5 1 2 1 2 3 1 5 1 2 1 1 1 13 1 2 1 2 1 2 1 6 1 10 11 1 31 32 1 1 3 1 2 3 1 1 2 7 1 1 2 3 1 6 1 2 1 2 3 1 2 1 9 1 11 1 26 1 2 1 2 5 6 1 1 95 1 1 1 3 1 5 1 8 1 1 3 1 1 3 1 2 1 4 1 6 1 14 1 2 1 1 2 6 1 1 3 1 1 2 13 1 15 1 2 3 1 2 1 7 1 1 1 3 5 6 1 2 3 1 1 3 1 2 1 2 1 12 1 2 1 22 1 2 3 1 1 2 4 8 1 2 3 4 1 2 3 4 46 1 1 1 3 1 2 3 4 8 1 1 1 1 13 1 15 1 1 1 1 1 1 106 1 1 2 3 1 2 6 1 1 2 11 1 1 14 1 2 1 1 1 20 1 1 1 130 1 2 1 1 3 1 2 3 7 1 2 3 1 1 2 1 2 6 1 1 3 1 1 15 16 24 1 1 2 3 1 2 6 1 2 3 1 2 1 1 8 1 2 44 1 2 1 1 3 1 1 3 9 1 2 3 1 5 1 1 2 192 1 2 1 4 1 1 2 8 1 2 1 2 13 1 1 16 1 2 1 1 3 1 1 3 4 5 1 12 1 2 15 1 1 1 1 2 4 1 2 7 9 1 1 1 1 15 1 2 3 19 1 2 1 1 2 4 1 1 2 8 1 12 1 1 1 1 17 1 2 1 2 1 360 1 1 2 1 4 5 7 1 2 1 2 12 1 1 3 1 1 1 1 …

Example 2:

Input: 3667 934622133 900912013 653127957 601325569 658564037 973991069 892509314 376451929 347172490 527982481 838541234 357000786 845902131 939597822 724711371 407914488 871204177 551479645 858341785 118164664 53599423 899859344 113914665 641254457 409934220 163170734 939018046 569783697 978155991 3385558 118239025 573042755 490696814 871523883 730673784 831636372 249570421 671025265 40428928 694304397 330979351 492981642 888826509 590409255 450903073 662797706 79044876 56480478 504596680 484467754 248614820 976290993 951764112 941770768 210649918 697730412 46926242 267469104 685126485 949312373 841080791 928811430 723952523 172952991 140544602 447963543 202646675 439386582 750412122 96929360 525443301 314620163 488116498 804933697 721604189 728596333 323523074 947340974 466486282 775530129 364…
Output: 1 1 1 1 3 6 1 1 1 3 4 1 6 8 1 1 3 1 2 1 1 8 1 2 1 1 13 1 29 1 2 3 1 5 1 2 1 2 1 4 1 2 14 1 1 3 1 1 3 1 1 23 1 1 1 2 1 2 3 7 1 2 1 1 1 3 1 2 7 1 2 1 2 12 1 2 1 18 1 2 1 2 1 1 3 6 9 1 1 2 4 1 1 3 1 2 1 11 1 1 1 1 2 1 7 1 2 1 4 5 1 1 1 3 1 5 7 1 1 1 11 1 2 14 1 1 1 1 19 25 1 2 81 1 1 3 1 2 1 140 1 1 2 1 2 1 1 7 8 1 2 1 2 5 1 1 2 4 19 1 2 1 1 164 1 1 3 1 2 3 4 1 9 1 1 3 1 2 6 1 1 1 4 11 185 1 2 3 4 1 1 2 3 1 6 1 1 3 4 15 1 1 2 1 4 1 1 8 1 2 11 1 2 3 1 2 17 1 2 1 4 1 6 1 2 1 4 5 1 2 14 1 2 1 235 1 2 1 2 3 4 5 1 2 3 1 2 11 14 1 1 2 4 5 1 21 1 2 3 1 1 3 1 5 1 2 1 2 34 1 2 3 1 2 6 7 1 9 1 1 3 1 1 2 3 1 9 1 2 3 1 1 6 1 1 9 1 2 1 4 1 1 1 4 1 1 7 1 1 2 33 1 2 1 1 3 1 49 1 1 3 1 1 3 4 1 1 1 4 1 1 2 1 1 10 1 12 13 21 1 1 3 1 2 76 1 2 1 4 1 1 1 3 1 1 2 8 1 2 3 1 5 6 7 1 17 1 1 1 2 102 1 1 1 1 1 5 1 7 1 …

Example 3:

Input: 3720 734090409 154616392 691911868 966239993 350659654 568469733 942902520 613223571 631004753 603878586 877769567 114030908 367370949 322174829 726469454 556317817 895880815 790917978 485874406 910200099 792816374 291994533 251419473 384939085 199430125 92989972 543658961 270871953 154618987 158743620 268999150 905915112 414284719 644073237 873603475 728693569 912593904 443886234 344917094 512975393 591404299 927652667 486078554 231132049 527425964 357394468 803484586 234885825 153680102 439994923 409912583 186977261 510972173 90674133 40037424 144311316 794466437 923998479 614874698 985942220 163645708 877072146 303384882 331755256 345920187 175237092 17493265 643738781 803668775 726130302 266453736 215813198 750344988 819211897 907833156 815245130 954094490 505943815 500952402 677243949…
Output: 1 1 2 4 1 2 3 1 2 1 4 1 2 1 4 1 10 1 1 13 1 1 1 3 1 1 6 1 1 2 3 12 1 2 3 1 30 1 1 3 4 35 1 1 3 1 5 1 1 3 1 1 6 1 1 3 10 16 1 60 1 2 1 2 3 1 1 6 7 1 1 1 4 12 15 1 17 1 1 3 1 2 1 7 25 1 1 1 1 3 1 1 2 1 4 11 12 98 1 1 2 1 1 1 6 1 1 1 1 5 1 1 14 1 1 2 1 2 6 1 2 9 1 2 3 1 2 6 1 1 2 3 1 2 1 1 3 16 1 2 141 1 2 1 2 3 1 5 1 7 1 2 10 1 2 1 1 1 3 5 1 1 2 9 10 1 2 13 1 29 1 1 3 33 1 2 3 1 2 1 1 3 6 1 2 1 4 14 1 1 17 1 1 1 3 4 1 1 7 1 2 1 11 1 1 2 4 1 17 1 1 2 3 1 2 1 8 44 1 2 1 4 1 2 3 8 1 54 1 1 2 4 1 2 3 8 1 2 1 1 1 1 4 5 1 2 1 4 1 2 3 8 1 2 1 2 3 14 1 21 1 2 1 4 1 6 28 40 1 1 2 1 2 3 1 1 3 4 1 11 1 2 1 143 1 2 1 4 1 1 1 4 1 1 3 4 1 1 2 8 1 2 1 2 1 1 3 1 7 1 1 3 1 1 13 1 25 26 178 1 1 3 1 1 3 1 2 1 1 5 1 1 1 2 10 1 2 1 2 18 1 1 3 4 1 6 1 2 1 2 1 1 3 1 5 1 11 18 1 2 1 4 1 24 1 2 1 1 1 229 1 2 1 2 3 1…

Constraints:

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

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