CT35868

The ledgers at Selene

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the moonlit lagoon of Selene opens only for a perfect tally of ledgers. Aldo 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: 2958 531075555 971546438 291066819 167671455 488463438 667617176 167265284 217579783 425310503 592258016 728015822 760590085 341485686 907136264 370556975 920372992 687382564 93611805 211123047 367141972 782263772 257253117 568372479 25919449 568602107 148598666 159723545 861553080 963044499 255993144 423761946 291033515 120895707 324259655 655968734 602060546 798371018 959264763 283194723 474159489 900634686 962652044 900539793 157033946 420571441 891988391 201288917 406538812 340142296 803629701 762208253 297177813 660064 153149389 522148144 133342011 891579782 642938939 424020151 452310203 283648283 247472146 936210049 892766988 93444818 593189378 915336130 8289403 633108673 132245265 160390037 582702811 812964426 45352867 832807294 516211480 258252805 335752277 481652572 994078565 4126…
Output: 1 2 1 1 3 4 1 2 3 4 9 10 1 12 1 14 1 1 2 3 5 1 2 1 4 1 2 12 27 1 2 1 1 3 6 1 8 9 1 2 3 13 1 1 2 3 1 2 1 4 1 1 1 2 4 1 11 1 1 2 1 1 21 1 1 2 4 1 2 1 2 3 6 1 8 1 1 2 3 80 1 2 3 1 5 1 2 3 1 2 1 1 8 1 2 1 4 5 1 1 2 1 1 5 6 1 1 3 1 17 1 1 1 1 2 4 6 8 1 2 1 2 1 1 5 6 34 1 2 3 1 2 1 2 1 1 10 1 2 1 2 1 4 1 1 3 1 9 1 13 1 2 1 2 75 1 1 1 1 3 6 1 1 2 3 1 2 1 4 1 2 1 2 12 1 2 16 1 1 1 1 21 28 1 2 1 2 5 109 1 1 1 1 5 1 2 3 4 1 6 1 1 3 10 1 1 13 14 1 2 1 1 2 3 1 6 1 1 3 26 1 1 2 1 4 1 2 3 1 2 1 4 5 14 1 2 1 2 3 4 1 48 1 2 3 1 2 6 1 1 3 4 1 2 1 2 5 1 1 18 1 2 3 1 5 1 2 1 1 2 4 12 1 1 2 16 1 36 1 1 3 1 2 1 2 1 9 1 1 2 4 1 1 3 8 54 1 1 3 1 1 1 1 2 1 226 1 2 1 1 5 1 7 1 1 2 1 1 2 4 1 8 10 1 19 1 1 1 329 1 2 3 1 2 6 1 1 1 2 3 1 6 8 1 2 1 2 1 6 1 2 1 2 19 1 1 3 1 30 1 1 2 3 4 1 2 8 1 1 3 1 2 1 1 8 1 18 1 1 3 …

Example 2:

Input: 2161 333166519 85250038 682671521 35719632 664118841 116372484 946307254 907732827 751041792 155124185 483885144 464556343 468840051 139812816 266402488 603466189 984152624 500451231 238176383 871596246 938194682 611192778 838106572 414584633 134807580 923119658 303085380 643283598 687346880 103270980 313811108 326136665 207938107 485767185 5959571 642894719 599447722 333954062 278583397 468411828 939894032 649560768 472351057 27950853 786949775 696553628 745606974 840887738 872903675 546353682 221505262 777824865 340357166 169023455 945623301 397166114 676412469 617225075 839145409 317284764 570769127 634137404 391932867 908604945 180380524 885679610 748279716 358239959 8454039 465706718 436963857 199462848 538670508 77878104 940527436 529596200 421930831 637260887 500876290 994935186 939…
Output: 1 1 3 1 2 1 7 1 1 1 2 1 2 1 2 7 17 1 1 3 4 1 2 1 1 5 1 2 3 1 2 3 1 5 1 7 1 1 1 3 24 1 1 1 4 1 2 7 8 1 1 3 1 1 38 1 2 1 4 1 2 3 1 9 1 2 1 1 1 3 1 1 6 1 20 1 1 3 1 80 1 1 2 1 2 1 4 8 1 1 3 1 5 6 7 1 1 10 11 1 1 1 2 5 1 18 1 2 1 1 2 3 1 5 1 2 1 1 3 1 15 1 2 1 4 1 2 7 1 9 1 1 12 1 2 3 16 1 1 1 3 1 22 1 2 1 4 1 2 1 2 3 4 5 1 2 1 37 1 2 3 1 1 3 1 2 1 10 11 1 83 1 2 3 1 2 1 4 1 2 1 102 1 2 1 2 5 6 1 2 1 1 2 1 7 1 1 3 1 1 13 1 2 1 4 1 1 2 4 1 2 1 8 26 27 1 2 3 1 2 3 1 1 2 4 1 2 1 1 2 3 11 1 2 1 2 3 4 18 1 2 1 1 26 1 1 2 4 1 1 1 3 5 1 7 1 2 1 4 1 17 1 1 3 1 2 6 1 2 1 271 1 1 3 1 1 1 7 1 1 3 1 2 13 14 15 1 2 3 1 2 3 1 2 1 1 26 1 1 3 1 2 6 33 1 1 1 1 38 1 1 1 4 1 2 1 2 3 1 1 3 13 1 15 54 1 1 3 1 2 1 1 1 9 1 2 1 4 1 2 1 2 3 4 1 1 9 1 2 3 4 1 1 1 3 4 6 1 21 1 2 3 38 1 1 1 1 1 5 1 2 3 10 1 1 1 3 1 2 3 1…

Example 3:

Input: 3658 177721233 13314595 522088355 666272013 105155521 258838252 491623170 464706307 323313493 302927321 181084520 598200951 317939295 20486641 964776862 966134607 684793528 780173126 426287376 146247238 628904607 678677191 140000192 527236563 500075406 836686018 798158755 62693441 896347873 646404431 601169683 85339889 644333433 418894289 361316792 41228887 245181011 488517953 679741092 270978289 345030461 754046785 502953889 196258514 899453816 867888611 522545854 996300019 621625866 24634314 41055635 358208807 798230388 35297806 904913396 325634352 119111591 204622418 843754210 169945164 695243439 57719502 330155998 711852392 444495669 165839417 6765409 269204440 494250671 108838210 315769274 240892859 91140960 285935019 413377373 471786746 704879717 637285025 453746293 481038712 2525924…
Output: 1 1 3 4 1 2 3 1 1 1 1 8 1 1 15 16 1 2 1 1 3 4 1 2 1 10 1 1 13 1 1 1 3 1 1 1 2 5 10 1 2 13 1 1 29 1 1 48 1 1 2 3 5 1 7 1 1 2 4 1 2 1 2 5 1 1 1 3 5 1 2 1 1 3 6 7 13 1 1 2 1 1 28 1 2 38 1 2 3 1 2 1 7 1 2 1 2 1 1 2 1 9 10 1 2 106 1 1 3 1 1 1 2 5 1 2 1 2 3 11 1 16 1 1 2 1 1 3 6 1 1 10 1 12 1 1 1 3 1 5 1 1 2 9 1 1 2 26 1 44 1 1 1 1 4 5 6 1 2 3 4 1 1 1 3 4 1 2 1 4 1 6 11 1 1 26 1 1 1 1 3 6 1 1 79 1 2 3 1 1 2 1 2 3 1 5 8 1 1 11 12 13 1 15 1 1 2 3 1 1 7 1 2 3 1 2 6 1 1 2 4 1 1 1 3 5 10 1 2 3 1 21 1 2 1 1 1 4 35 1 2 1 1 1 3 1 8 1 10 1 2 3 1 1 6 7 8 9 20 1 1 1 2 5 1 1 3 4 30 1 67 1 1 3 1 5 1 90 1 1 1 2 4 6 1 2 1 2 3 4 1 1 3 1 2 18 1 1 2 3 4 1 1 3 4 1 2 1 1 1 6 1 12 1 1 2 20 1 2 1 1 5 45 218 1 2 1 1 3 1 7 1 2 1 1 3 1 2 3 1 8 1 1 3 1 5 1 1 1 19 1 2 1 2 1 4 5 8 1 29 1 1 1 4 5 6 1 8 1 2 1 2 1 2 1 2 5 6 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.