CT50461

Sable's Azure marks

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the opal reefs of Shimmerdeep as Sable unrolls the day's manifest of marks. The tally will decide the next shipment. 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: 232 777180623 324014100 338962431 209477241 62578451 782191280 448914254 351210526 972855952 223632261 143840902 69003869 595244629 154620154 592227144 421383591 71339323 210131618 325635573 11977498 331572390 820371 946076078 146780816 304188109 452161861 121643851 442861827 11718654 629829006 397025576 897151854 788889061 948487995 835312266 486536264 620820076 100815473 229461638 156016053 846836339 500970751 61306326 433205794 211282170 773148643 299932727 393101927 947670811 212621319 178764118 237256982 700741682 134219510 950121948 859133177 423931151 666044283 409248911 668600078 423158624 499101268 337774913 387077237 496604204 37784601 92779515 268689186 537542205 32272923 776376513 950889588 124602137 679564861 877834910 134463097 385933323 285287736 275028874 904287396 33975590…
Output: 1 1 2 1 1 6 1 1 9 1 1 1 4 1 2 1 1 2 3 1 5 1 14 1 2 3 1 2 1 7 1 9 1 25 1 1 2 1 2 1 7 1 1 2 1 5 1 2 15 1 1 3 4 1 46 1 1 2 1 4 1 2 1 2 3 1 2 3 9 1 15 63 1 2 3 1 2 1 1 8 1 1 3 1 2 1 7 1 1 1 3 4 6 1 2 1 97 1 2 1 2 1 1 7 105 1 2 1 1 5 1 2 1 4 1 2 3 4 1 1 16 1 2 3 4 1 1 1 3 1 2 1 8 1 14 31 1 1 3 1 2 1 7 8 1 1 2 12 1 1 2 4 5 1 2 1 1 5 1 1 1 2 58 1 2 3 1 1 3 1 8 1 10 1 2 176 1 2 1 2 1 4 5 1 7 10 1 2 1 1 2 3 7 1 1 2 1 2 23 1 1 3 1 1 3 1 1 3 1 1 1 1 37 1 2 1 2 3 1 2 6 1 1 2 4 5 1 1 1 2 3 6

Example 2:

Input: 3636 671168981 282103581 292678114 470917275 311808576 583832184 906206816 112520080 387693827 337479030 189616573 161108306 645127854 709165379 227664300 716839104 5024398 556012010 932746387 477242848 467595838 464945378 962481047 4855725 649352538 538287478 411676723 714232746 918315015 781352317 874205834 487973207 426387917 991516917 468109918 743546031 846110033 445604074 352691727 477571602 706393441 570674371 201489687 206382066 142611756 672144567 449964698 122427404 670307560 570061527 451185353 424901039 828076493 112862585 496080049 21329275 310812590 704166599 830997891 943584998 869787405 119684151 22460009 505480376 811618401 959049669 2147867 96608130 518542765 13540222 713032826 556736428 474157829 871142906 481747031 447971339 497584513 623454955 225426086 717897270 72573…
Output: 1 1 2 3 1 5 7 1 2 1 1 1 6 7 1 9 1 2 19 1 1 1 23 1 2 1 1 5 6 1 2 1 1 34 1 2 3 1 1 3 4 1 1 2 1 5 1 1 3 1 1 1 16 1 2 1 2 5 22 26 1 1 1 3 4 32 1 2 3 1 5 1 1 8 1 1 3 4 1 6 7 1 1 50 1 2 3 1 2 6 1 1 1 4 1 2 1 1 2 4 17 1 1 1 3 1 2 3 1 9 1 2 1 4 1 2 3 1 2 6 1 21 1 23 1 2 1 4 1 2 1 1 9 1 1 1 1 4 5 7 57 1 1 1 4 1 2 1 1 1 4 1 1 7 10 1 1 13 1 1 2 1 5 6 1 1 3 1 1 3 4 31 1 2 3 4 1 1 1 2 3 1 7 1 2 1 1 3 1 7 1 2 3 1 1 3 1 5 1 28 1 2 3 1 1 1 1 8 37 1 1 1 3 5 1 7 1 1 2 1 137 1 1 3 1 5 1 7 1 2 1 2 3 4 1 1 1 3 1 1 2 4 1 160 1 212 1 2 3 1 1 3 7 1 2 1 1 2 1 4 5 1 2 1 10 1 12 1 1 1 4 1 1 1 3 1 6 23 1 1 3 4 1 2 3 1 9 10 1 1 2 39 1 1 3 1 1 1 7 1 1 3 1 2 1 2 1 16 1 1 58 1 2 3 4 1 1 65 1 1 1 3 1 1 3 4 1 6 1 2 1 2 1 1 2 18 1 2 1 1 5 1 2 8 1 2 3 1 1 1 2 1 9 1 1 2 3 1 5 7 1 2 3 11 1 1 14 1 51 1 1 3 1 5 1 1 2 1 5 1 1 8 1…

Example 3:

Input: 123 746744625 479105402 831433631 531327966 267083107 247204077 118088212 973505985 43550661 556490137 405707272 327513425 908807399 145051235 805526063 902813941 869028630 287574952 232058051 896371018 341601994 133804268 651147370 734588425 811558320 481548892 133170016 647469384 97265883 817453913 730791287 945392104 551867892 931357798 289322774 441319153 53207282 451025235 455527038 514137866 328495149 406815972 690699246 125773913 957927220 739612329 324798081 525063074 293755574 57946850 361753737 533784629 919037844 177529646 368550852 380684571 113862250 566328508 492644683 194502776 335559645 94450826 343874042 442888456 932749193 691034323 278731067 151539033 841771429 394931868 45122275 833171285 541915958 87959688 454743787 842285280 610249653 128583836 906128979 731936632 398…
Output: 1 1 3 1 1 1 1 8 1 2 1 1 5 1 2 3 1 1 1 4 1 1 3 4 5 1 1 3 1 10 1 24 1 2 1 2 1 4 5 6 1 2 9 1 37 1 1 2 1 1 3 6 8 1 2 3 1 5 1 1 2 1 4 5 20 1 1 1 4 1 1 3 1 1 2 11 1 1 14 1 1 1 3 1 1 86 1 1 3 1 2 1 2 1 4 1 1 2 4 11 15 1 1 1 4 1 1 2 1 1 3 26 1 1 3 1 5 1 1 2 4 1 2

Constraints:

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

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