CT42618

Farhan's signals Reckoning

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

At the glass towers of Prismhaven, Farhan records each signals 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: 2784 612445342 709517323 333295590 995669132 784343175 474169113 653706416 694418534 172232571 733490531 479966747 871794316 614227297 948975026 775539290 2697594 499700947 738894308 178315317 7841883 57512091 693810488 787487883 315573576 378394549 704524490 806107276 898177664 563106367 399623557 444420846 710794261 791285218 779099207 730664958 680782091 945858293 854960237 75461305 83516671 689192369 440812691 728293777 75027378 261028706 767845577 18604215 620446021 533047497 923312066 253292892 538635329 312137750 167338752 54154641 914935116 706225809 223338756 727836219 696666861 151176209 425975567 853533363 903029691 922588999 171357356 905508014 533166318 241526239 451930016 832335918 439444538 501094235 714327468 973643593 341241292 128409676 584283136 723826841 953302386 67770…
Output: 1 2 1 4 1 1 2 3 1 5 1 8 1 10 1 1 2 3 1 1 2 4 9 1 2 3 13 14 1 1 2 4 5 1 1 1 23 1 1 2 3 1 5 1 2 8 1 2 1 13 1 2 1 1 1 6 1 1 3 1 1 2 7 8 15 1 2 1 1 2 4 1 2 3 71 1 1 3 4 5 1 1 3 1 1 1 2 3 4 6 8 1 89 1 1 2 1 2 5 1 2 1 2 1 2 5 1 1 3 17 1 2 3 1 5 1 7 1 1 1 11 1 2 1 125 1 1 1 3 1 2 6 7 1 2 1 4 12 1 2 3 1 2 1 4 1 1 3 11 1 2 1 2 3 1 1 19 1 1 3 1 36 1 1 1 1 3 1 1 2 4 9 11 1 2 1 2 3 6 1 1 2 10 1 1 2 3 1 6 7 1 1 2 21 1 23 1 1 3 1 2 6 1 1 1 1 1 1 2 6 1 2 10 1 90 1 2 1 1 3 1 7 1 2 3 1 1 6 7 1 1 3 1 2 1 7 1 9 1 2 1 2 1 1 5 1 7 1 1 1 13 37 1 2 1 2 1 43 1 1 2 1 2 5 1 1 1 4 1 2 1 1 9 15 1 2 3 1 2 6 7 1 1 3 1 1 2 7 1 2 1 1 2 1 36 296 1 1 2 1 5 1 2 3 1 2 1 4 1 1 1 4 9 1 2 1 16 1 2 1 2 1 1 2 1 5 1 7 1 2 3 1 5 1 14 1 18 1 1 3 1 41 1 1 2 1 4 5 1 1 3 9 1 2 1 1 5 1 1 2 18 1 1 22 1 2 1 2 1 28 1 1 3 1 2 1 7 1 2 1 2 1 …

Example 2:

Input: 2927 862282621 637037295 988319513 386864312 977075062 981523637 453308929 161538182 558430664 663754858 613487275 717726186 579536123 362197614 398110852 418540811 156642311 494656329 41509398 679689163 585424895 647393572 713945989 50264220 170996076 251655973 846222493 321165089 602440319 257032595 627845265 921069339 340064294 689840899 156976769 166119962 87491225 794343831 771618005 773328597 627540237 488353771 944717954 296745899 796623907 590976621 835141636 160887911 566387458 465672791 47229765 104238473 405785732 509033031 419334279 745245941 117866302 230916015 26015902 84721011 681356027 952156377 663125001 970489543 717223490 321510187 35131314 38237881 942829000 439389655 192031174 107548161 637978231 23032964 117896057 953137018 733271690 614204926 275976863 982082091 4076…
Output: 1 1 3 1 2 3 1 1 3 4 1 6 1 1 2 3 1 5 1 8 1 2 11 1 2 3 21 1 2 1 4 26 1 2 1 2 1 6 1 2 1 1 37 1 2 1 4 1 2 1 1 2 3 5 1 9 1 2 1 2 5 56 1 58 1 1 1 2 5 1 1 1 4 1 2 12 1 1 1 77 1 2 1 1 1 1 5 1 2 1 9 1 2 3 4 1 2 3 4 1 21 1 1 1 25 1 2 3 1 2 1 2 8 1 10 1 1 118 1 1 1 1 5 1 1 1 2 1 4 1 1 9 1 2 1 1 14 1 16 1 2 1 20 1 2 3 4 1 2 7 8 152 1 2 3 1 2 1 2 3 4 10 11 1 2 3 1 2 6 1 1 3 4 5 23 1 2 1 2 5 1 7 1 2 1 1 2 13 14 1 1 2 1 5 6 7 1 2 1 1 3 13 1 1 3 4 1 2 3 35 1 1 1 1 5 1 7 1 2 3 1 2 3 1 1 9 1 2 77 1 1 3 1 5 6 1 8 1 1 3 4 1 14 1 1 3 4 1 2 3 8 1 101 1 2 1 4 1 6 1 2 1 1 1 12 1 14 1 1 17 1 1 1 1 5 6 1 1 2 4 1 6 1 1 2 4 11 1 2 3 1 1 2 4 1 2 1 11 1 2 1 4 1 2 7 1 37 1 2 3 4 5 1 1 2 4 5 1 2 320 1 1 1 1 3 1 2 8 1 2 3 1 2 1 2 8 1 2 1 2 5 1 23 1 1 1 4 1 1 3 1 5 1 2 8 36 37 1 2 3 4 1 2 44 1 2 1 2 5 1 2 3 4 1 1 1 3 14 1 …

Example 3:

Input: 1164 485884559 925876155 537588297 697104829 364083762 581262213 599925888 161066847 754488500 945473324 196509164 407132212 942308997 836106275 799359905 224579047 748927800 482361660 542239278 382925627 696572306 57619196 939423550 367928796 825643248 732043949 864994199 567894786 404084551 753791222 176297114 595719431 750690070 437269151 703886803 177023782 479139884 146933914 499359320 432346859 323977785 8332734 614815224 462150133 433298165 213112716 113872705 680652467 34203478 425212550 297944325 328560391 964192215 53703012 850909427 327408812 417909453 120496973 174978556 669212629 795613403 932886353 187050894 745554468 18374149 832143977 894310037 617233113 98469173 515156776 958380249 85776626 340112208 289220316 140831758 260454935 524952970 260478521 314793201 299904472 765…
Output: 1 2 1 2 1 2 3 1 7 10 1 2 3 1 1 1 2 1 2 1 4 1 10 1 2 1 4 1 1 3 1 2 3 1 2 1 2 1 4 1 1 1 8 1 1 1 1 13 1 2 1 2 53 1 2 1 2 1 2 5 6 9 1 2 1 4 5 1 1 2 18 1 2 1 1 2 6 1 2 1 10 1 2 3 1 2 3 1 18 1 1 3 1 1 2 1 2 27 1 2 1 2 1 2 34 1 2 3 1 5 111 1 1 2 4 1 1 1 3 1 1 3 1 5 9 1 2 1 1 1 3 1 1 23 1 1 2 1 4 1 2 1 2 5 34 1 1 2 1 5 1 1 1 1 4 1 6 8 1 15 1 2 1 4 5 1 2 1 4 1 1 3 8 9 1 1 2 13 1 1 3 1 2 1 1 2 4 1 11 12 1 2 15 1 17 1 1 1 1 5 23 1 2 3 4 1 1 1 3 1 6 11 1 1 2 3 1 2 7 1 110 1 1 1 1 4 5 1 2 8 1 2 1 2 1 6 1 1 1 4 1 2 1 1 9 1 1 2 4 1 30 1 2 3 1 2 3 1 8 1 1 1 4 43 1 2 1 2 1 1 7 1 1 3 4 1 13 1 1 3 1 1 2 3 1 22 287 1 2 1 1 5 1 2 1 1 1 3 1 5 6 1 1 2 18 1 1 3 1 2 1 1 1 3 5 6 9 1 2 1 1 3 1 16 1 2 1 2 1 2 3 1 2 3 9 31 32 1 1 3 1 2 6 1 2 1 2 1 44 1 1 2 4 1 1 1 52 1 2 1 1 1 2 7 1 2 3 1 2 13 1 1 3 17 1 2 3 4 5 1 2 3…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Farhan's signals Reckoning - MEDIUM Coding Problem | CodeTikki