CT46412

Jasper ledgers Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the savanna camp of Amberplain pays by the answer, and Gino intends to earn it. First: the full register of ledgers. 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: 3789 317321496 218910276 849847592 164067805 984411433 394107961 874480756 40302552 464448233 234374405 298676122 531328765 839277024 403696517 901587495 152488340 667759216 509689931 791886883 185087276 119153914 591669505 956280268 405726469 651300932 507961475 958649648 542938689 826377203 250871951 487987988 599070207 217666826 847682834 248236555 206297798 625889239 430310555 616834184 263649873 289925765 303543108 703466495 571821737 638291314 353112276 419345321 958282227 698734932 235081061 743033065 719258098 245275536 578071388 281771822 915769452 115859903 364679825 397967654 21421052 894456592 394262275 300841440 292126686 972626158 783174710 248499740 460122477 305204937 107814311 250152534 68060429 400547104 819208905 183673399 185522890 635679452 480932910 402246354 11508526…
Output: 1 1 3 1 5 1 2 1 2 1 2 5 6 1 10 1 2 1 4 1 1 3 18 1 2 1 22 1 2 1 2 3 1 7 1 1 3 1 2 1 2 3 9 1 2 1 2 21 1 1 3 1 1 2 1 8 1 2 3 1 5 1 1 1 60 1 1 2 1 1 2 1 5 9 1 2 3 1 1 1 2 5 6 1 2 9 1 23 1 2 1 1 2 3 7 1 2 1 4 1 1 3 103 1 1 3 4 1 1 1 3 5 1 11 1 1 2 4 1 6 7 1 1 2 4 1 2 7 8 1 1 11 1 20 1 2 3 1 1 1 2 1 6 1 1 2 3 4 1 7 1 1 2 1 2 3 6 1 2 46 1 2 1 50 1 2 1 2 3 1 2 6 1 2 1 2 11 1 13 1 1 18 1 1 1 1 5 1 1 1 27 28 1 1 3 1 1 6 85 1 1 3 1 2 1 2 1 6 1 8 1 10 1 12 1 1 2 1 1 5 1 7 9 1 2 1 1 1 4 1 1 9 1 2 3 4 1 2 3 1 138 1 1 2 4 1 2 3 4 5 1 2 3 1 1 3 1 2 1 1 3 9 1 1 1 2 3 5 1 1 2 31 1 2 1 2 1 1 3 1 1 2 11 1 13 1 1 2 4 1 1 3 4 1 2 7 1 2 1 4 1 1 7 1 33 1 2 1 2 1 4 5 1 1 8 44 1 1 1 1 3 1 7 1 53 1 2 1 57 1 2 3 1 1 2 3 4 1 1 8 1 10 1 1 1 4 1 2 7 1 2 10 1 2 83 1 1 1 1 5 1 1 1 1 2 5 6 127 1 1 2 3 5 1 7 135 1 2 1 4 1 6…

Example 2:

Input: 1338 642441163 264552611 985115308 826422704 915820349 457196516 327675005 617254227 638061649 512506868 103008355 452201914 407608043 455069312 292466932 411171472 23645467 788951419 993014495 695723205 931993760 671916675 418471556 404014478 930434110 587456439 616586563 580963062 177603229 710512223 708730892 477499581 224794138 152296221 166895686 536018598 467061984 952378099 176634442 557357322 390782311 884363004 624029062 382570100 796038508 466034414 312112778 646291682 236215207 458432577 676865629 862515574 622786988 832309754 500224192 489167009 725050001 665860854 95726110 767966412 27016962 351894296 665525640 20995603 205265785 719507095 233076939 536702105 107285724 77252498 908937363 299322087 180381147 924511640 700539617 311452189 945454162 143861834 803754083 395190996 …
Output: 1 1 3 1 2 1 1 3 4 1 1 2 1 4 1 2 1 13 19 1 2 1 1 1 4 1 2 1 1 5 1 1 1 1 2 5 1 19 1 2 1 4 1 1 3 1 1 3 1 2 6 10 1 2 1 1 3 1 1 6 1 2 3 1 2 6 1 2 1 1 33 1 1 36 1 1 39 1 2 1 4 1 2 3 4 1 1 3 4 1 2 3 4 1 2 3 20 1 2 3 1 1 2 3 1 2 7 1 2 1 1 3 94 1 2 3 1 2 3 4 1 9 1 2 1 2 1 2 1 2 1 2 9 10 1 1 1 2 15 1 1 20 1 1 1 1 1 129 1 1 1 3 1 6 1 2 1 2 11 1 2 1 4 1 1 3 4 1 2 1 1 5 1 11 1 1 3 1 5 1 1 3 4 5 1 2 1 4 26 1 1 1 1 4 6 1 1 2 1 2 3 54 1 2 1 4 1 1 1 2 5 6 1 2 3 197 1 2 1 1 1 1 5 1 9 1 11 1 210 1 1 3 4 1 1 2 3 4 1 1 8 1 1 2 3 1 14 1 2 3 1 1 2 25 1 1 3 1 1 3 4 8 1 35 1 1 1 1 1 2 4 5 1 9 10 1 2 3 1 1 2 3 18 1 2 3 1 5 1 7 62 1 2 1 4 1 2 1 1 2 1 283 1 1 2 1 307 1 2 1 1 1 3 7 1 1 1 4 1 2 7 1 9 1 1 12 1 1 1 1 1 25 1 1 2 3 1 1 6 1 2 1 10 344 1 1 1 4 1 1 3 1 1 3 1 12 1 1 3 1 5 1 1 20 1 1 3 1 1 3 1 2 1 7 1 12 1 2 1 1…

Example 3:

Input: 3196 590125639 306973743 824037578 847764207 405282600 788331998 270702831 605931320 341894933 682622092 858445814 949215086 196788500 605876044 488217033 627632106 132176523 742690958 21643240 621951028 984915691 590349256 363594670 717459170 976935014 341442717 626142989 967062747 190233494 492799255 529579501 108148896 222061858 170111212 640871903 492016074 694585489 185883754 108848468 476986254 773241138 187262263 814254130 184852028 575565300 898142844 466115196 626070139 967202166 997344620 548221630 98635299 208794178 914630613 618725457 448807021 274878931 906226336 310314423 879548665 450922632 176029629 826167565 152770805 775627275 22948993 493956149 631394554 903016524 862402397 109043475 968465028 609772110 109219151 743230045 530165949 448100632 794154 776870655 430579524 3…
Output: 1 1 3 4 1 2 1 2 1 4 11 12 1 2 1 4 1 6 1 2 21 1 1 3 4 1 2 3 1 2 3 1 2 1 7 1 9 1 1 3 13 1 15 1 2 18 1 2 24 50 1 1 2 4 1 1 1 4 1 2 1 1 3 1 2 1 2 3 11 1 1 22 1 1 3 1 1 1 7 1 1 2 4 12 1 1 3 4 1 6 1 1 2 4 1 1 3 4 5 1 1 2 4 1 1 7 8 9 1 2 3 1 2 42 1 2 1 4 1 1 2 1 2 1 1 7 9 1 2 1 13 1 1 2 1 2 1 20 1 1 3 28 1 1 1 2 5 6 1 8 1 2 1 4 1 2 1 1 2 4 1 1 21 1 2 1 1 5 1 2 3 1 2 3 4 8 1 1 16 1 1 2 1 1 3 23 1 1 1 3 5 1 1 3 1 1 1 1 36 1 1 2 4 1 1 2 1 9 1 2 1 1 3 1 7 1 9 1 2 21 1 1 2 1 175 1 1 1 4 1 1 2 3 1 5 11 1 2 14 1 2 1 2 5 20 1 1 3 1 2 3 4 1 1 1 4 1 6 1 1 36 1 1 1 4 5 1 2 3 1 5 6 1 224 1 1 1 2 4 6 1 1 3 10 1 1 1 2 4 1 6 18 1 2 3 1 2 1 1 5 1 1 1 1 3 5 1 2 3 9 19 1 2 1 4 1 6 1 2 46 1 1 3 1 51 1 2 1 4 1 2 3 1 5 1 1 1 2 14 1 1 2 1 5 20 1 2 1 24 1 1 2 1 2 5 1 2 3 1 35 1 2 1 4 5 1 2 1 2 1 46 1 1 2 1 1 6 1 1 3 1 …

Constraints:

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

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