CT47374

Cartwright's Silent marks

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the valley of Misthollow opens only for a perfect tally of marks. Cartwright means to find out. 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: 2526 852698761 4797761 849688873 272923342 807938204 446447343 576555861 264449254 372589972 466698525 63588005 673314131 487165260 831148264 79746600 215385148 781325855 263988780 882601825 426875045 131333238 516749381 51355835 840757723 506966069 336419207 18502075 475272637 807752686 737449769 680581433 48702980 865892383 136609749 397799217 364862050 426469137 32816137 997551252 771586179 110613626 347502695 466088721 158605924 547640464 162857667 390889416 422516166 583320583 849115972 9669696 492858568 948504868 530880994 242100632 380526147 691552420 935700221 231825824 37361041 391214161 207466442 364529100 848477479 258455535 973866934 796084347 631645129 387611186 812577372 82701390 576296299 58951078 592527106 748381095 761892338 140191814 839227503 183258736 192076725 91527239…
Output: 1 1 2 1 2 1 2 1 2 3 1 7 1 11 1 2 3 1 19 1 1 3 1 5 1 1 1 3 5 1 1 1 14 1 2 1 4 1 39 1 1 2 3 1 5 1 2 3 9 11 1 2 14 1 1 2 4 5 1 1 3 1 2 6 1 27 1 1 1 4 1 2 1 4 5 6 1 12 1 2 15 1 1 18 1 20 1 1 2 1 4 1 1 7 1 9 10 1 13 1 35 1 2 1 4 1 2 7 8 1 2 1 2 1 4 1 8 1 1 2 55 1 1 1 4 5 6 1 2 9 1 1 1 2 3 6 1 1 2 4 1 1 2 1 2 6 7 12 1 2 1 2 1 1 3 6 1 1 38 1 2 1 1 3 44 1 1 2 1 2 5 1 1 1 2 11 12 1 1 3 1 2 3 1 2 1 1 3 1 7 8 1 1 2 1 16 1 2 1 20 1 1 3 1 2 3 1 1 1 2 1 6 1 1 2 1 2 1 7 1 9 1 2 1 4 1 6 16 26 1 2 1 1 1 58 1 2 3 1 2 3 1 1 3 1 5 12 1 2 1 2 5 1 1 2 1 1 6 1 2 3 1 5 1 7 1 1 2 1 12 36 1 2 3 1 2 6 1 2 3 4 1 1 1 4 51 1 2 1 1 3 4 7 1 130 1 258 1 2 1 2 1 2 1 2 5 1 7 1 1 1 13 1 1 16 1 2 1 2 23 1 2 3 1 1 2 7 1 2 33 1 1 1 4 1 2 7 1 1 3 4 1 13 1 1 1 4 1 2 3 8 9 1 1 355 1 1 3 1 1 2 4 1 2 1 11 1 2 1 1 3 1 1 3 1 2 1 1 13 …

Example 2:

Input: 3091 851484736 472654990 867648025 298321114 855089991 324709057 904190632 528670709 474411116 136944512 80723809 141856626 598322887 263071254 782710120 34725582 563332220 508736054 525645065 201598577 38358283 316443584 730747626 371454921 755494828 305716132 286499628 1493318 282931173 395369638 637411854 479264326 785429213 805217993 515167127 377823386 39221664 375464153 706213758 685773378 584201259 594467984 946644370 635029347 502704631 378570795 506191719 538518998 653383860 203282920 409583179 263624409 696763425 92602692 603754249 361004388 822765834 991085354 823327310 408186152 726722609 178118400 249477191 909362367 656909837 549131959 499726711 925016079 650256436 559729890 736962283 34174059 991678734 512980469 943168284 374071881 524484871 301318690 207312058 641944182 106…
Output: 1 1 3 1 2 1 7 1 1 1 1 3 6 1 8 1 2 1 2 1 1 3 8 1 10 1 1 1 2 5 6 1 26 27 1 1 1 2 5 1 1 2 43 1 1 1 3 4 6 1 2 1 10 1 2 1 14 58 1 1 2 1 2 6 1 1 1 10 1 1 3 1 73 1 2 1 2 1 1 5 1 7 1 1 3 1 1 6 16 1 1 3 1 1 3 1 1 6 1 2 1 2 11 1 2 1 2 3 1 2 8 1 2 1 1 3 1 5 1 7 1 11 1 51 1 2 1 2 1 6 1 1 9 1 1 12 13 1 1 3 4 1 1 2 1 4 6 1 1 3 1 5 1 7 1 1 3 1 2 1 2 5 22 1 2 1 1 5 1 1 8 1 1 3 1 5 14 1 2 3 1 1 59 1 1 1 4 1 1 1 2 5 6 1 1 3 14 1 2 3 1 5 6 1 1 3 1 5 6 1 8 1 10 1 18 1 2 1 1 5 6 1 2 100 1 1 2 1 2 3 4 1 2 1 1 9 1 1 12 1 1 1 1 5 1 7 1 2 249 1 2 1 1 2 3 1 1 258 1 2 3 1 5 1 2 8 1 2 1 2 3 1 2 3 9 1 1 2 1 14 1 2 1 18 1 1 3 1 1 1 1 26 1 36 1 2 1 2 5 1 2 3 1 10 11 1 1 1 4 1 2 1 1 20 1 2 1 1 1 2 7 8 1 1 2 1 4 1 71 1 2 1 4 1 1 7 1 1 3 1 2 1 7 1 1 1 3 12 13 1 2 1 2 3 6 1 2 1 4 1 12 1 2 1 4 1 2 7 1 21 1 1 3 1 1 1 1 3 43 1…

Example 3:

Input: 943 423141269 914794314 378800268 289791200 717155315 938160776 917011807 480110199 59672040 654372819 12854341 730175321 695780866 996526098 75338533 777331528 811815640 358973433 815029773 129937343 495625930 83594761 26679442 843873516 514106429 405954582 702256052 179760846 436520474 814559043 856952051 864091892 93563249 333202510 780881517 533647396 516104796 720980020 333223170 154511122 893201778 972900001 999348077 76036210 618700622 833944819 653100784 417651970 796650978 820165189 435198764 134095715 631332350 910597503 546800354 45169720 418952293 402171539 739272390 261093922 825570331 324991505 612341975 495642731 747106858 238460787 297541644 514278695 381648483 532496352 898000522 262781978 137304587 770668333 794966988 939323041 775955000 231718240 801480758 474811527 6952…
Output: 1 2 1 1 3 6 1 1 1 3 1 5 1 14 1 2 3 1 5 1 2 1 1 10 1 1 3 1 2 6 17 18 1 2 3 1 1 3 1 1 27 28 43 1 2 3 1 1 3 4 1 1 3 11 1 1 2 1 5 1 7 1 2 1 4 1 2 3 1 5 17 1 1 3 4 33 1 1 3 1 2 1 7 1 1 1 3 1 2 1 8 1 2 3 12 1 2 1 4 5 1 1 8 1 1 11 1 1 2 1 1 6 1 1 3 1 2 1 2 1 38 1 1 1 49 1 1 1 4 54 1 1 3 1 2 60 1 2 3 4 1 2 1 1 2 4 1 8 73 107 1 2 3 4 1 1 2 1 5 1 1 3 9 1 2 1 1 18 1 1 2 22 1 2 3 1 1 1 1 30 1 2 3 1 5 143 1 1 1 4 1 1 3 1 2 6 1 2 1 10 1 2 1 4 1 1 17 1 2 1 1 5 1 2 25 1 2 1 2 5 178 1 1 1 4 1 1 1 4 1 2 7 1 1 3 1 2 3 7 1 1 2 4 12 1 1 22 1 2 1 4 1 2 3 1 31 1 2 1 1 36 1 1 1 3 5 1 2 1 1 1 3 5 1 2 3 1 1 11 1 1 1 2 5 1 1 1 4 5 11 1 1 3 4 1 1 2 1 1 2 1 12 1 1 80 1 1 2 1 1 3 6 8 1 2 1 2 3 1 7 1 17 1 2 1 1 5 1 7 8 1 1 3 1 2 6 7 1 2 115 1 1 2 3 1 6 1 2 1 1 1 1 7 1 1 3 4 1 2 1 1 2 1 24 1 1 1 2 5 1 7 8 1 2 1 1 3 1 1 2…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Cartwright's Silent marks - MEDIUM Coding Problem | CodeTikki