CT42332

Gardener Counts the signals

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the temple city of Sunspire pays by the answer, and Gardener intends to earn it. First: the full register of signals. 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: 3519 218948305 744104379 852315472 906280383 198076772 857024489 713919819 389454852 807498756 362171603 547069496 192105895 894643144 327435448 713937552 974226061 659620814 280201383 574975315 813748930 189279877 490902755 905661405 384902515 243979856 896360807 773432743 991947205 866997271 695952528 580791003 537950946 718261248 514245628 551750024 631498658 537863423 81640219 609995661 297614188 811059453 273165069 307453390 812179558 936291618 201092378 142180458 807799904 6720192 71412670 249251183 165421466 134998703 275845316 199162078 558752757 609955286 317610435 367934148 663965613 28594304 279428513 972235405 998776438 454464921 484225803 78585757 86519552 35914029 44671730 927606612 597580477 427542367 666078503 198803531 554601237 46344289 880075206 824012075 821225742 30790…
Output: 1 2 3 4 1 2 1 1 3 1 2 1 9 1 2 16 1 1 2 4 1 2 7 1 1 3 1 28 1 1 1 1 4 1 2 3 1 1 3 1 12 1 2 15 17 1 1 3 1 2 3 1 1 6 1 8 9 1 2 12 1 2 35 64 1 2 1 2 1 2 7 1 1 3 1 2 1 7 1 1 1 1 3 1 1 2 16 1 1 3 1 1 6 7 1 2 1 98 1 2 3 1 1 6 1 2 1 4 11 1 1 1 15 1 17 1 1 1 4 5 1 24 1 1 1 4 1 1 2 1 1 5 1 1 13 1 2 1 2 3 1 20 21 1 1 3 1 2 51 1 1 2 4 1 1 3 4 1 1 1 3 5 10 1 2 1 2 3 4 7 22 74 1 1 2 1 1 5 1 2 1 2 3 1 1 3 9 1 1 2 1 2 3 6 1 9 1 25 1 1 1 4 5 6 1 1 3 1 11 1 1 14 1 1 2 3 5 1 21 1 1 2 1 52 1 1 1 2 1 5 1 60 1 1 2 1 5 1 1 1 1 1 71 1 2 3 1 2 1 1 2 1 2 6 1 1 1 3 11 1 1 1 4 5 17 1 1 1 4 22 1 2 1 4 1 1 7 1 2 1 2 1 4 38 1 2 1 1 2 3 1 2 6 1 11 1 13 1 1 2 1 1 6 1 2 3 1 2 66 1 2 1 2 1 4 1 2 1 8 11 1 2 1 1 16 1 2 19 1 21 1 23 1 2 1 4 1 6 1 1 3 4 171 1 1 2 1 1 5 1 253 1 1 2 4 5 1 2 3 9 1 2 3 4 14 1 2 3 1 1 1 4 1 6 24 1 2 …

Example 2:

Input: 792 559746900 353224791 700746871 52322140 347437578 586558668 717613260 202294887 853727900 97210099 869713477 836761810 825801126 521857540 540176104 434360147 89868 434572506 281462081 440990978 581050529 34072059 333313025 33730637 872281623 711976461 498793550 702016529 770286688 684280463 672108930 539774530 97795664 70781431 608371616 549073061 567055136 292361301 997697949 417269565 957263120 416205869 922066866 550968915 721390759 411898525 62154115 731105346 221075206 160378566 396048415 392081897 676896907 618949537 584326399 918210106 238010681 787660200 36491356 101844437 983506458 739403885 205255632 987050787 26078683 216354247 345467978 829802792 439168257 466205343 881526943 757857797 193379531 274070778 481006340 49844582 90795604 915355738 940343927 582289931 229393184 6…
Output: 1 1 3 1 2 3 7 1 9 1 11 1 1 1 2 1 1 3 1 5 8 1 2 1 25 1 1 2 4 1 1 1 1 1 4 1 2 1 39 1 2 1 2 1 2 1 1 5 1 1 3 1 5 1 1 13 1 2 1 2 22 1 1 25 1 2 3 4 1 2 7 1 1 2 3 1 2 14 15 1 1 3 4 1 1 3 4 9 1 1 3 1 2 1 2 1 1 7 1 2 1 2 24 1 2 3 1 1 1 2 4 1 113 1 1 3 1 2 1 4 8 1 1 2 4 1 6 1 2 1 2 19 1 2 1 1 2 3 1 5 1 10 11 1 1 1 1 5 1 1 3 1 1 11 1 1 3 1 2 1 18 1 1 1 3 1 2 1 2 1 2 3 1 1 8 1 64 1 2 3 1 2 1 7 1 1 1 2 4 1 7 1 9 1 1 3 1 2 6 1 24 1 2 3 28 1 1 1 3 1 1 1 4 9 10 1 2 1 2 5 1 2 8 1 2 21 1 1 2 1 4 1 1 3 4 1 2 3 4 1 1 37 1 1 3 1 1 3 4 1 2 1 1 3 4 5 1 2 1 1 3 6 1 1 3 1 5 1 1 2 1 1 5 6 1 25 26 36 74 1 2 1 1 2 6 1 2 1 1 11 114 1 1 1 4 5 1 1 2 9 1 2 1 2 3 6 1 2 1 4 1 1 13 1 15 1 2 3 4 5 1 1 2 1 1 11 1 28 1 1 1 3 4 1 1 3 4 1 2 11 1 13 1 1 3 4 1 2 1 2 5 1 2 3 1 2 1 7 13 1 1 3 17 1 2 3 1 1 1 2 3 1 5 1 7 1 2 1 16 1 2 …

Example 3:

Input: 186 942955573 842788611 799855185 364051110 668135030 120937066 236017370 251010778 8413718 454753959 914973235 774652268 921651500 569447613 415714148 748812017 757325208 53101678 341188496 636528423 618450168 809897745 162629330 468070689 841048555 582658008 844958260 852826837 868901009 49353934 506006354 9544480 915082367 393879871 210837423 53808538 225885001 742646980 629710913 658174439 682965868 419754467 417995281 887094675 211341131 82061672 569622688 11966973 103619545 783791406 819165383 937767662 371856740 131933504 577904207 357190056 110066114 915561227 109180603 195800246 742863752 765964485 952461220 116972815 73276335 117101066 382397926 56784724 480363620 61762901 695474108 892197027 774144630 273151378 488928739 695252831 320001250 612164224 392742331 738170767 46260222…
Output: 1 1 1 1 2 1 2 3 1 5 10 1 12 1 1 3 4 1 2 3 1 9 1 2 12 1 14 15 16 1 2 1 20 1 1 1 3 5 1 2 3 1 1 11 1 1 3 1 2 6 7 51 1 1 3 1 1 6 1 2 3 4 63 1 1 3 4 1 6 1 8 9 1 1 2 3 1 2 1 7 1 1 1 1 5 1 1 1 17 1 1 3 1 5 32 33 97 1 1 3 1 2 1 1 1 2 3 6 1 2 3 1 11 1 2 3 1 1 2 23 1 2 1 2 1 4 7 1 1 10 1 12 1 2 1 4 1 6 1 1 9 10 1 1 2 1 2 1 2 8 1 32 1 1 2 1 1 5 6 8 1 2 1 2 1 1 2 1 9 1 2 1 2 22 1 2 3 1 1 1 2 1 1 3 7 1

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Gardener Counts the signals - MEDIUM Coding Problem | CodeTikki