CT49107

Owen Counts the marks

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the shipyard of Keelwind as Owen 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: 3605 133271622 252630884 612038415 942759832 463351717 333939464 780211052 631582244 277926065 667095522 425431342 753863201 576598203 419738090 998763106 60202034 309959815 300265200 419591704 393324055 957525411 587633313 975429471 79315016 459932890 56642412 792556169 400414299 742770488 836937770 710659015 788907906 679012713 447321277 542997313 767638461 756234375 745411253 434562197 317200487 29889701 954045942 114943429 259382994 349404880 305443386 128565044 823644216 992811338 916034747 637748063 182629080 340045050 932300986 577334394 720378452 664220951 811422017 969956779 144460647 304497368 105363059 554713981 209652950 175881811 899876198 904804670 342287312 481412609 26792450 848190825 350753585 572545656 162932116 973850094 832963016 135899038 656073473 931144314 430791443 …
Output: 1 2 3 4 1 1 3 1 1 3 1 5 1 1 15 1 2 1 4 1 6 1 8 1 2 1 4 1 2 7 1 2 1 1 2 4 1 1 1 1 1 19 1 2 3 1 1 6 34 1 1 1 2 5 1 2 1 4 10 1 2 1 4 1 1 7 8 1 2 1 4 1 2 1 26 1 1 2 4 1 2 1 1 1 2 1 2 1 8 41 1 1 2 1 5 1 1 3 1 1 3 7 1 1 3 4 1 2 19 1 2 1 1 1 2 5 1 2 1 1 1 1 1 4 1 2 1 1 2 1 15 1 22 1 1 1 4 1 2 3 32 1 1 95 1 1 1 2 3 4 1 8 1 1 3 1 2 1 1 1 6 1 1 1 165 1 1 3 1 1 6 1 2 1 1 11 1 13 1 2 1 1 2 19 1 2 3 1 5 1 7 1 2 1 2 1 1 5 8 1 1 3 4 1 1 3 8 9 1 2 1 1 3 4 1 25 1 1 3 4 1 1 3 1 9 61 1 2 1 2 1 6 1 1 2 3 5 1 7 1 2 16 1 1 1 1 1 1 1 5 1 2 1 10 90 1 2 3 1 2 1 1 1 2 5 1 2 8 1 1 1 4 1 2 3 4 9 1 2 3 4 5 1 2 3 1 2 3 4 30 1 2 3 1 1 2 3 5 6 1 11 1 2 1 1 1 4 1 2 3 1 11 1 1 2 1 27 1 1 1 4 67 1 2 3 1 1 3 4 1 2 1 2 5 1 2 12 1 2 1 2 1 18 1 20 1 1 3 27 1 2 1 1 1 2 1 8 1 2 1 1 3 1 1 1 3 4 1 1 2 22 1 2 1 1 3 1 7 1 2 1 11 12 1…

Example 2:

Input: 2601 366969634 505672991 199409510 924329049 535241552 925007594 62393836 685979048 432389674 98704734 669104940 309966071 235989841 900762538 467459997 56356545 715503085 666429109 810534823 120046400 137893621 451406030 189542215 180304368 722715094 909963876 710370930 705832940 616473233 537329256 909728390 283828886 581080895 408470894 625980957 354117954 586150714 716833520 114574995 788331360 645755569 688849970 237815245 704041789 940485226 840908579 757074190 258900033 532048270 301726293 826434959 790226682 579611092 222296193 166657907 374257015 675630475 653683444 996175716 205536387 592244175 428062896 633113539 578404290 387419013 969810955 949414452 911998600 547868852 146357207 580582931 53576963 343226193 59118054 903548769 263045111 667786550 430480306 69627820 919360131 9…
Output: 1 2 1 4 1 6 1 2 1 1 3 1 1 8 1 1 3 1 5 1 2 3 1 1 6 20 1 1 1 1 5 1 2 1 4 1 2 7 1 9 1 2 1 4 45 1 1 1 2 1 5 1 1 1 1 3 5 1 59 1 2 1 4 1 1 7 1 1 1 1 3 1 2 1 7 1 2 1 1 13 1 2 1 2 1 4 5 8 1 31 32 1 1 3 95 1 2 1 4 1 6 1 1 1 1 4 5 1 7 9 1 2 1 19 1 2 1 2 3 1 1 3 7 1 9 1 1 2 3 5 6 1 2 1 2 5 1 1 2 26 1 2 1 1 3 1 2 1 2 5 37 1 2 1 1 2 1 4 1 1 8 1 12 1 1 3 4 54 1 2 1 4 5 1 1 62 1 1 3 4 1 2 7 1 2 3 1 1 2 1 4 1 1 7 1 10 1 2 3 4 1 1 3 4 1 2 1 1 23 1 1 1 3 119 1 1 3 1 1 2 1 1 6 7 1 1 13 1 2 3 17 1 2 1 2 3 4 1 1 1 2 5 1 2 1 1 1 6 7 8 1 2 20 1 1 1 1 5 6 1 1 9 1 2 1 2 1 2 1 2 3 58 1 1 2 4 5 1 1 8 1 1 69 1 2 1 1 1 4 1 2 1 2 1 2 82 1 2 1 2 5 1 2 3 1 1 3 4 1 1 3 1 1 6 11 1 1 17 1 2 3 21 1 2 1 4 5 1 1 34 1 1 3 4 1 241 1 1 1 2 5 1 2 1 9 1 2 3 1 1 3 1 5 1 1 11 12 1 14 1 1 2 4 1 1 1 1 5 1 2 3 13 1 1 3 17 1 1 20 1 36 1 …

Example 3:

Input: 3450 372842456 663557213 677278933 963898937 202668223 573867814 506420053 172012786 306280098 984803188 605206509 717899682 987973391 74801264 485812530 379385630 583787184 225350214 452069706 574027895 29330917 737681174 361378130 685073783 143429813 144410561 541108654 907409919 29205569 937955506 236962307 92789832 902970143 407568187 309775675 113818044 51718621 908188776 52400002 649029830 93627732 475810046 655467342 977557585 197767236 371844730 535373600 636312290 147539780 490042347 759543465 781275099 32933717 861676068 778279146 921462947 669002489 643696189 651300009 294894942 283088492 202190329 733182236 785011359 688464360 479203727 898301429 287266983 357403929 143920213 212398168 8737210 381305586 271542861 501287569 887127103 560291163 251961823 743716465 554331501 52916…
Output: 1 2 3 4 1 2 1 1 2 10 1 2 13 1 2 1 4 1 2 3 1 9 1 2 1 2 3 15 1 17 1 1 3 1 1 1 1 8 1 2 1 2 5 31 1 2 3 4 1 2 7 8 1 10 1 12 1 1 2 1 1 1 7 8 1 1 11 1 2 1 2 1 6 1 8 9 1 1 3 1 1 6 27 1 2 42 1 1 1 4 1 1 2 4 1 6 1 2 3 100 1 2 3 1 5 1 7 1 2 1 1 3 1 2 1 7 1 9 1 1 12 13 1 2 3 26 1 2 3 1 1 1 3 1 1 7 8 1 2 1 1 2 1 44 1 2 3 1 2 6 1 1 1 2 3 12 1 1 2 3 17 1 2 3 1 5 1 1 1 2 3 4 1 7 14 1 16 1 1 2 4 182 1 2 1 2 1 6 1 2 1 2 5 1 1 3 4 1 1 1 2 1 6 16 1 2 1 1 21 1 2 1 2 1 1 3 1 1 6 1 2 1 4 1 2 1 39 1 1 2 3 1 1 3 1 2 10 1 2 3 4 1 1 1 4 1 1 2 3 62 1 1 1 2 4 1 1 3 1 1 2 3 1 6 1 2 3 17 19 1 2 3 1 2 1 2 3 6 1 1 1 10 1 2 1 1 18 1 1 108 1 2 1 2 3 1 1 2 9 1 1 2 4 1 1 1 8 18 1 2 1 2 1 2 1 8 1 2 29 1 2 1 1 1 1 4 1 6 1 1 41 1 2 1 1 2 1 4 1 1 3 1 1 6 12 1 1 3 1 1 2 1 1 1 1 3 1 2 14 1 1 2 1 1 6 7 1 2 10 1 2 1 4 1 2 1 1 2 10 1 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Owen Counts the marks - MEDIUM Coding Problem | CodeTikki