CT38014

Squire's Whispering Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

At the sulphur springs of Brimstone, Squire records each beacons in a worn leather ledger. The guild wants answers, not guesses. 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: 3902 323866574 607543861 193791213 629567625 946876604 969590487 754744927 862812949 349246378 566101309 985127031 573994304 279468743 998474162 288970745 853608329 174985015 657956629 211881839 243652280 163037231 899858390 724180934 147515358 502680592 253099675 366902515 624864974 391990185 946787310 513747034 339212787 394012370 110789722 670200080 206552071 209527236 67298595 326799916 305873829 554573774 901661618 426763361 198097927 246096127 701244488 360522471 842911261 393870574 336843755 223828199 291007954 338996126 743262070 625383648 545303944 233233188 150504860 218151423 948910185 282868063 320391023 308964999 502119705 338525490 768764903 248807419 346387917 999674737 197821115 932885410 124015234 462463573 658215185 454461940 752953050 528676814 162678914 517972680 615158…
Output: 1 2 1 4 5 6 1 2 1 2 11 1 1 14 1 2 1 2 1 2 1 8 1 1 2 1 2 5 1 16 1 1 2 1 5 1 2 1 4 1 6 12 1 1 2 4 1 6 1 1 1 2 4 6 1 1 1 1 2 46 1 2 1 4 1 6 1 2 69 1 2 1 2 3 1 5 1 1 2 4 1 2 1 2 1 4 5 17 1 2 3 4 1 1 3 1 5 1 2 8 30 1 2 1 2 1 2 1 4 1 1 2 10 1 1 2 1 2 48 1 2 1 1 2 4 7 1 1 2 3 5 6 1 65 1 1 3 4 1 2 7 1 1 3 4 1 2 1 8 1 10 1 1 3 1 1 16 1 2 19 1 1 2 1 1 3 1 8 1 1 3 1 1 3 1 8 17 1 2 1 2 1 2 5 6 1 2 3 10 1 1 2 1 1 5 1 7 1 1 3 12 1 2 3 16 1 1 2 1 2 1 6 1 2 10 11 1 13 14 41 1 1 2 1 1 3 1 1 1 4 11 1 2 3 1 16 1 2 19 20 1 1 1 1 5 1 2 1 2 1 6 1 2 3 10 1 12 1 2 1 21 1 2 1 1 3 4 5 29 1 2 1 1 3 4 5 143 1 2 3 1 1 3 1 2 1 4 8 1 2 1 4 5 1 1 1 4 1 2 3 1 1 1 4 1 2 30 1 1 2 1 1 3 4 1 6 9 1 2 13 1 2 1 1 1 4 1 1 2 3 1 2 3 1 9 1 17 61 1 2 3 1 2 1 4 212 1 2 3 4 1 2 1 4 1 2 1 2 3 1 11 1 2 3 1 20 1 1 3 1 2 1 2 8 1 1 3 1 379…

Example 2:

Input: 3006 6911595 624395993 160779327 765869990 556081261 395932571 527627082 94250220 339249295 107958542 711523492 4480210 613088831 384836311 564509905 434726704 250459756 813952148 103164598 305688650 615002657 180508778 450370252 645342008 681485408 472457556 669662107 8206146 992027338 445172418 397922745 413137438 376938597 946895524 740384155 198323946 332879140 152443922 463745154 535258795 432978643 262711386 617164757 80036032 315563216 418186320 137824991 204410065 385788037 100898311 297553744 714077998 634412424 260943914 69156659 17453683 778188301 49313073 251046047 623896495 43541819 971471 75291688 636209380 185151774 470503486 194418905 406790548 238354843 931240083 786352199 417376054 400612049 95636241 455642255 503941059 774548505 158317698 851440771 142025036 100921869 44…
Output: 1 2 1 4 1 1 2 1 2 1 7 1 2 1 2 1 1 18 1 2 3 1 2 6 7 1 2 1 29 1 1 2 1 5 1 1 2 1 4 5 1 1 8 1 2 3 1 2 3 1 2 17 1 1 1 1 23 1 2 3 1 1 3 7 1 2 1 2 1 36 1 1 1 1 4 5 6 1 9 1 1 3 1 55 1 2 1 2 3 4 1 2 3 4 1 12 1 1 3 1 1 3 4 1 9 1 2 3 4 1 2 1 4 1 1 1 2 3 5 7 1 2 1 2 1 1 1 6 1 10 11 1 20 1 39 1 2 1 2 1 2 1 4 5 1 9 1 11 1 1 3 1 5 17 1 1 20 1 1 23 1 25 67 1 2 1 2 3 4 5 142 1 1 1 2 3 1 6 7 1 1 2 3 4 1 2 1 4 9 11 1 20 1 2 3 1 25 1 2 3 1 5 6 1 2 1 2 5 1 7 1 1 3 4 1 6 1 1 1 17 1 51 1 1 3 1 5 1 1 1 1 4 1 2 1 14 1 2 3 1 1 6 7 8 1 1 3 12 1 14 1 81 1 1 3 4 5 1 7 1 9 1 1 1 1 1 4 6 1 2 9 1 12 1 1 1 3 5 1 1 1 4 1 6 24 1 2 3 4 1 6 1 1 3 4 1 2 13 270 1 1 1 2 4 1 2 8 9 1 1 2 1 4 1 1 8 1 1 1 3 4 1 1 1 4 18 1 2 3 4 1 1 25 1 2 3 4 1 2 1 1 1 3 5 1 2 8 11 12 51 1 1 2 1 1 1 1 7 1 10 1 1 13 1 1 3 1 1 6 1 2 3 4 5 1 1 1 4 1 1 …

Example 3:

Input: 3003 992830624 861117279 133471631 196815695 632311611 747917837 696577465 910850811 814646123 757198557 979743967 530692602 799395993 622682225 423245362 320940422 865314556 298027315 249422290 58391750 792948701 913220626 425422976 554770790 736240252 119296783 112082940 379843276 367675481 38155456 703207305 601066793 427176753 138628674 230874456 17165219 65325272 948179706 275419833 912760489 783576809 831371133 928999706 765567023 766040471 992721790 559724438 589275405 917620974 317411570 109339610 230423974 340898272 778432559 40734974 256229778 647477432 293530697 781250128 670573613 592406127 727292139 965603828 826152218 999038703 273734446 158854662 677652473 802181326 293887669 527551065 199981551 537196839 663325829 30870079 890167638 954605821 181359823 178256731 139867144 8…
Output: 1 1 1 2 3 4 1 7 1 1 10 1 2 1 1 1 6 1 1 1 4 11 1 2 3 1 1 3 1 1 6 1 1 1 2 1 2 27 1 2 1 2 5 1 2 45 1 2 3 1 1 2 4 5 1 2 3 1 10 1 1 3 17 1 65 1 1 3 4 1 2 1 4 5 1 11 12 1 1 1 4 1 2 7 1 9 1 2 24 1 1 3 1 2 6 1 2 3 34 1 2 1 1 3 40 1 1 2 4 1 1 1 3 4 5 11 1 2 14 1 2 1 2 124 1 1 3 1 2 1 4 1 2 1 4 1 2 7 1 1 1 2 19 1 2 1 1 2 3 1 2 7 8 1 2 1 2 1 2 1 4 1 1 1 10 1 24 1 2 3 1 29 1 2 3 4 1 1 1 3 1 1 3 1 1 1 7 1 2 1 1 16 1 1 3 1 5 6 1 2 25 1 2 1 1 1 6 1 2 3 1 1 6 1 43 1 2 3 1 2 1 7 1 2 3 11 12 1 2 15 1 1 2 19 1 2 3 1 5 1 2 1 4 1 6 1 2 1 2 1 17 1 1 3 1 2 3 1 2 9 1 2 3 4 1 6 1 8 1 2 1 1 3 1 2 1 1 5 1 65 1 1 3 4 1 1 2 4 1 1 11 1 1 1 2 3 5 7 1 9 1 2 3 13 1 2 3 4 1 1 1 2 1 6 1 12 1 1 1 4 1 6 1 2 1 1 1 1 4 1 1 10 1 18 1 1 1 2 23 1 1 38 1 1 1 4 1 1 3 1 2 1 2 50 1 1 1 1 2 3 1 8 1 2 3 1 13 1 2 1 1 1 4 1 1 1 4 1 2 3 8 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Squire's Whispering Ledger - MEDIUM Coding Problem | CodeTikki