CT55569

The Streak Back of the Golden ledgers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the jade shrine of Serpentis, Draper studies rows of ledgers entries. One clean number will settle the guild's oldest argument. 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: 1989 393022449 149003577 716777473 849338012 338307468 26831106 598509011 47337108 194121065 882276322 489025168 540361119 833163694 918354457 725561893 273100216 548439723 617776482 961520410 198641909 653224309 880879241 275741098 785545609 754052660 749127312 204036614 166535721 358518545 502338925 696105786 197217747 534792083 234893561 80287078 554583818 884243237 911504622 968845010 572537140 946631810 987001120 95533841 582818590 644165656 759572533 610269630 683541233 537499891 511506090 528119425 275739114 392138022 924847336 46769903 335134025 586051853 218100498 689545700 547429625 17759128 163551997 388324677 468660114 369361403 312331209 597584518 225235533 37509346 409579905 370953859 875601420 699935264 667539128 495357775 11459294 706915512 524195695 399370245 604648417 361…
Output: 1 1 3 4 1 1 3 1 2 10 1 2 3 14 1 1 2 3 19 1 2 3 1 2 1 1 1 1 3 4 5 1 2 1 1 5 18 19 39 1 2 42 1 2 3 4 1 2 1 1 2 1 2 12 1 2 3 1 5 1 1 2 3 4 1 1 8 1 1 3 1 18 1 1 1 1 5 1 1 3 1 5 83 1 1 3 1 1 1 3 4 1 1 11 1 2 1 2 1 2 7 1 1 2 4 1 13 14 1 27 1 2 30 1 1 3 1 1 1 37 1 1 2 3 4 5 1 2 1 1 2 3 12 1 1 3 1 2 3 20 1 2 3 1 5 1 7 1 2 3 1 1 1 2 4 36 1 2 76 1 1 1 3 5 1 2 8 1 1 1 1 1 14 1 1 2 3 1 1 6 1 8 1 2 1 1 1 4 5 6 9 10 1 1 2 3 1 5 6 8 1 1 3 1 1 6 1 1 9 1 1 1 4 5 1 7 17 45 1 2 1 2 1 2 66 1 1 1 4 5 1 7 1 9 1 11 1 2 14 1 2 3 1 1 1 4 1 1 10 1 2 1 4 1 2 1 18 1 1 1 1 2 5 1 7 1 2 1 2 12 1 1 2 1 17 19 1 2 3 1 2 1 2 1 1 1 1 4 10 1 12 1 17 37 1 2 1 1 2 3 62 1 1 1 4 1 6 1 8 9 1 1 1 89 1 1 2 4 94 1 2 1 4 1 1 1 4 1 2 3 12 1 1 3 1 1 3 7 1 1 1 1 3 1 7 1 16 1 1 1 3 1 2 35 1 2 3 1 5 1 1 2 3 4 1 1 1 4 10 1 1 2 1 5 216 1 2 1…

Example 2:

Input: 2441 82176260 543095148 3486536 981846861 842120250 280699136 827964024 907484042 775820796 278790648 15933061 229033746 239122217 239839847 582378378 647283783 943308695 626628119 93194042 304116791 423298469 774939535 145290793 152396287 669595655 679255882 864145402 54302843 61548699 500577147 290118913 904321635 354659448 386068395 832067471 170196043 83912976 704589526 761866709 463395395 298200381 970532562 523452598 545450476 516376181 206973541 445039274 668968843 159139223 903627668 370735601 397385501 838361758 499137880 868299600 919769040 275184315 312984536 684337222 836647135 976049469 419778347 755197765 63719690 325997192 23418745 522365965 784273965 697624525 15289329 557810150 832062666 792807091 92279152 24671298 722282658 528221149 891902823 122009795 47686942 531024649…
Output: 1 2 1 4 1 1 2 4 1 1 1 2 3 4 6 7 13 1 1 2 3 5 1 2 3 4 10 1 2 3 1 15 1 2 3 1 1 3 4 1 1 38 1 2 1 1 2 6 1 8 1 2 3 1 5 14 1 2 3 4 57 1 2 1 2 1 4 7 1 1 2 11 1 1 1 3 1 17 1 1 3 1 2 23 1 1 1 2 1 6 1 2 9 33 1 2 1 98 1 1 3 1 2 3 1 2 3 1 1 12 1 14 1 1 17 1 2 1 4 5 1 1 1 9 1 2 3 4 1 2 1 1 18 1 2 1 39 1 1 42 1 1 1 2 1 4 1 6 1 2 3 1 2 14 15 1 1 1 2 1 6 22 1 2 1 1 1 1 3 1 7 1 1 2 1 5 1 1 3 4 1 11 1 2 1 2 1 2 27 1 1 1 3 5 1 2 1 1 2 1 1 62 1 2 3 1 2 3 4 1 2 1 4 1 1 14 1 16 1 2 1 2 1 2 5 128 1 2 3 1 5 1 1 3 1 1 1 7 1 1 1 16 1 2 19 1 2 1 1 5 1 26 1 1 1 3 1 1 2 4 1 1 10 1 1 14 1 2 1 1 5 1 1 3 4 10 1 2 1 54 1 1 1 3 4 6 7 1 1 3 1 1 3 1 5 1 2 1 4 1 1 15 1 2 3 19 209 1 1 2 4 1 2 3 1 1 3 1 1 1 4 1 16 1 2 1 1 1 2 7 1 1 1 3 5 1 1 3 4 1 1 2 1 1 10 1 2 1 1 1 2 4 1 2 1 2 3 6 1 1 3 55 1 1 2 268 1 1 1 1 2 1 4 6 1 10 1 1 …

Example 3:

Input: 881 629965372 248091997 330851384 925016388 540808127 443441176 135629311 846820908 56908114 330182472 606440060 691046130 152237582 194143335 643827862 720753128 428097885 241463827 328677273 572071386 631341148 146883750 661721051 618453594 366149735 656240299 367586544 113350689 12337093 901490994 561809957 232559480 836569005 610977495 668359189 539170827 757167967 472807169 890117551 194757817 117751238 917027370 306645558 72580062 254359721 353035920 342066728 758692235 564648868 464932756 866736593 849873787 119749631 581527260 272236300 929722081 452248204 957031959 827240434 507833905 765696338 108171443 295629774 539289943 619919954 983511092 423643859 72737755 663159682 302552033 46612584 391532282 130842649 801865523 126950719 229045756 839767526 263581129 537843906 147391939 6…
Output: 1 1 2 4 1 1 1 4 1 2 3 4 1 2 3 8 1 1 2 4 5 1 7 1 1 3 1 1 1 26 1 1 3 1 2 1 4 1 9 1 1 38 1 1 2 4 1 6 1 1 9 1 1 2 1 56 1 58 1 1 2 1 2 3 4 66 1 1 3 1 1 3 1 8 1 2 11 1 2 1 4 1 1 1 1 3 1 6 1 1 2 4 1 13 1 2 3 32 1 34 1 2 3 4 1 1 1 8 1 1 3 1 13 1 2 1 2 1 6 7 1 2 3 1 1 6 27 1 1 1 4 66 1 2 3 1 137 1 2 3 1 2 1 7 1 2 1 2 3 1 14 1 2 1 2 3 1 1 1 2 3 1 7 11 1 2 1 4 1 2 20 1 2 1 4 1 1 2 3 5 1 1 2 1 4 5 7 1 1 2 16 1 1 2 3 4 1 2 1 8 1 1 1 4 1 1 2 8 1 2 11 12 1 2 1 4 66 1 1 2 4 1 1 2 4 1 10 1 2 1 2 3 1 1 3 9 1 1 3 1 14 1 1 17 1 2 3 1 5 1 7 1 2 27 1 1 3 107 1 2 1 4 1 2 1 8 1 1 1 2 1 5 1 1 2 1 1 20 1 1 2 3 4 1 1 2 8 9 10 1 2 13 1 2 3 1 2 3 20 1 1 2 3 46 1 1 1 1 1 2 7 1 1 2 1 4 6 7 1 1 3 1 5 1 2 22 1 2 1 179 1 1 3 1 2 3 4 1 2 1 11 1 13 1 2 1 1 5 1 1 1 1 2 5 6 1 14 1 1 3 1 1 2 1 2 6 1 1 3 27 1 1 3 1 1 1 4 1 6 1 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Streak Back of the Golden ledgers - MEDIUM Coding Problem | CodeTikki