CT54373

The Streak Back Beneath Brimstone

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Elowen found an old ledger of ledgers in the apiary attic at the sulphur springs of Brimstone. The margin notes pose a precise question. 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: 86 947446973 695323614 91172761 521954079 533013586 236881295 244784867 410967729 610298563 392165771 571407407 494932739 582893485 951018083 609612865 138269558 387583531 492373315 69992902 677801299 292797011 83554448 929743938 639724977 113414738 634013777 936678828 275345088 86155213 551650077 277626448 450761999 533428730 577521306 891123660 671389896 458054732 192717201 306793807 510754016 993502885 682695682 50854390 399766497 940593626 502739920 593074747 112912215 268177071 351347188 485739594 864682802 832590681 122458437 957622231 447418119 378571367 425371954 730043859 158101496 736784323 745004170 463890686 698581371 774718116 851571213 929658331 197360117 144084372 436942860 572931831 218607757 153025227 861074230 895400153 681328911 310704028 752962283 603446029 179520569 69…
Output: 1 1 1 2 3 1 2 3 7 1 2 1 4 14 1 1 2 3 1 6 1 1 9 1 1 2 13 1 1 3 1 2 3 7 8 1 1 1 2 4 41 1 1 2 4 1 2 1 2 3 4 7 1 1 14 1 1 2 4 1 6 7 1 2 10 11 12 1 1 3 4 1 1 7 8 1 1 3 1 1 3 1 2 9 1 11

Example 2:

Input: 1498 842041906 965950426 208050400 16643063 469484965 682452447 948918168 555567913 39393449 789154087 81879836 495423403 129658278 651616951 832224960 25601220 778543569 672598287 843750022 562375540 33436394 464843500 79863377 168862826 756581517 883517686 693450582 756927697 239684694 19484398 688344835 554292827 675860182 876741087 78523767 573780764 754272137 942489061 140705839 991487913 537332133 954186431 169746892 150321344 41853906 440367570 290417468 889936620 681004211 236526112 750955278 326544565 603878490 1681424 185775644 548654109 270014402 13668968 912501282 59460549 644761301 900501793 698840965 730743892 40711440 425058880 145464966 130785766 401326679 727543429 310304983 697521266 175308771 316944489 20968965 587505651 288027931 72318479 315116939 210353033 297243706 5…
Output: 1 2 1 1 3 4 5 1 1 3 1 2 1 4 8 1 2 1 12 1 1 2 1 2 6 19 1 2 1 1 3 1 2 8 1 2 3 31 1 40 1 2 1 1 1 4 1 6 1 1 3 1 2 1 2 3 1 1 17 1 2 3 1 2 1 2 1 1 3 6 1 2 1 2 1 4 1 1 3 1 2 6 1 2 13 1 2 1 1 50 1 1 2 1 2 3 1 5 1 2 3 1 5 11 15 1 1 2 4 5 6 1 2 1 4 1 1 2 1 5 1 17 1 2 1 1 2 88 1 1 1 2 1 5 1 2 9 1 1 1 4 1 2 3 1 1 1 2 1 5 14 1 2 3 4 5 1 7 1 1 2 11 1 2 3 1 39 1 2 1 2 1 4 1 1 3 1 2 6 180 1 1 2 3 1 5 1 7 1 1 1 1 1 1 7 1 1 3 18 1 2 3 4 1 2 206 1 2 3 1 2 6 1 2 1 1 11 1 1 2 3 1 5 7 1 9 1 1 23 1 1 2 1 4 6 30 1 2 33 1 1 1 3 1 39 1 2 1 1 3 4 1 2 3 1 1 1 1 3 4 1 2 3 1 1 2 1 2 6 1 2 17 28 1 2 3 1 1 6 1 1 3 1 2 6 286 1 1 2 3 5 6 7 8 9 10 1 1 2 3 1 5 1 1 8 1 2 1 4 1 1 3 17 1 1 1 3 5 319 1 2 1 2 1 1 1 4 9 1 2 1 13 1 2 3 1 2 19 1 1 2 3 1 1 1 4 8 9 1 2 3 1 14 35 1 1 1 1 5 1 1 2 4 1 1 2 3 9 1 2 3 1 19 1 2 3 1 5 1 2 1 2…

Example 3:

Input: 140 789796022 95778731 733323196 228127201 4654630 833424919 746600985 721093388 637886410 599845441 983178410 389404885 468950493 545811258 174772176 721341648 667305105 120539732 642753160 741620760 564409548 928994241 875785446 870085246 180441562 130543667 70384517 608169007 202068347 889518517 882014997 161425564 592597353 649019741 651007359 932178698 545076137 831331407 90009941 532589475 466264093 510125827 336248936 620293444 925884178 527035669 638229137 610128758 190819142 784364881 806655576 189652816 880281444 233750187 908621820 210502542 203891342 785054496 836535836 620447543 723912317 164014891 872700517 266198770 930050558 752243085 815741506 958270675 989043480 502106100 929422723 679899342 9665608 183805393 454191721 777113044 226840363 353919516 545281534 793921043 463…
Output: 1 1 2 1 1 6 1 1 1 1 11 1 2 3 1 5 1 1 2 9 1 11 1 1 1 1 1 4 1 8 1 1 2 3 4 25 1 2 1 2 1 2 1 6 9 1 2 1 1 5 6 1 8 1 10 1 1 3 4 1 2 1 8 1 29 1 2 57 69 1 2 1 1 2 3 5 1 2 3 9 1 1 3 4 14 17 1 1 2 1 4 1 1 8 1 1 2 3 4 6 1 2 1 1 2 3 1 2 1 24 1 1 2 1 1 30 1 1 3 1 2 1 1 3 9 1 1 12 13 1 15 1 64 1 1 1 68 1 1 3

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Streak Back Beneath Brimstone - MEDIUM Coding Problem | CodeTikki