CT52341

Ravi's registers Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The tallyman Ravi has been asked to balance the workshop's books. On the desk lies a long table of registers readings. 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: 3159 729091860 827424575 198018938 400428309 296971464 983281247 192116468 486884305 58010968 995122627 515810861 299843186 942834071 894347453 654992439 324913367 149834715 484610940 864613196 335480101 384912618 120321933 719579530 122451910 921628391 628819293 299316188 145474206 220910310 115424447 620285868 994724467 221356363 376415890 798349072 389566925 137857656 863640175 155775656 360350914 231929714 932891741 457681014 476036323 193986699 545121659 104538823 159892591 110463522 104919847 498107602 7619111 910732534 690720630 742303207 881666123 637135201 237298437 787640233 958798292 730469502 320357531 246061733 822829786 787508550 985770431 388032059 906436965 997677883 280312881 392911631 936231157 786822662 386616345 659227383 938777480 484640882 124113034 393012947 24684262…
Output: 1 2 1 2 1 6 1 2 1 10 1 1 3 1 1 1 1 3 5 1 2 1 4 1 12 1 1 1 2 1 5 22 1 2 3 1 1 6 1 2 1 10 1 2 1 4 1 2 1 1 5 1 11 1 2 3 1 1 3 28 1 1 1 4 1 34 1 2 69 1 2 3 1 1 2 7 1 1 2 1 12 1 1 3 4 5 1 2 1 4 5 1 2 8 1 1 1 1 1 3 7 1 1 18 1 2 1 2 1 2 7 1 1 28 1 2 3 1 50 1 1 2 1 2 1 2 1 4 1 6 1 8 14 1 66 1 1 1 1 5 1 2 1 4 1 2 1 2 1 1 1 2 1 5 86 1 1 2 1 4 1 2 3 1 10 1 2 1 169 1 2 3 1 2 3 4 1 1 3 1 1 6 1 2 1 17 1 19 1 2 3 4 1 2 1 1 1 4 1 2 1 1 3 1 1 1 13 1 1 2 1 1 3 1 1 2 4 24 1 1 3 1 1 3 1 2 1 1 2 6 1 2 12 1 43 1 2 1 47 1 1 2 1 1 3 7 1 1 3 1 2 1 1 2 4 1 1 19 1 68 1 1 2 4 5 74 1 1 3 1 2 1 1 2 3 5 1 2 3 1 5 16 1 1 3 1 5 1 2 1 2 1 1 3 1 2 1 11 1 2 1 36 1 1 2 3 1 1 1 1 5 1 2 1 1 5 51 1 1 3 1 1 3 1 5 6 1 1 3 1 2 1 4 1 6 19 1 2 1 152 1 2 1 1 3 1 1 2 1 2 1 10 1 14 1 2 1 4 19 1 2 1 2 1 6 1 8 1 2 1 2 1 2 3 16 1 1 19 1 1 …

Example 2:

Input: 915 640995202 886925380 99010508 191547900 580671106 929225220 436348288 876035753 840735331 747879727 8695745 823252895 93948372 984362987 483027271 669160880 105507195 337931869 40631368 522634317 780219410 277787344 833043205 219641809 545938258 980825853 720268890 64667427 905720436 748661807 699751686 759245482 988247587 937573864 570983316 102312037 954163431 664752129 232800283 387250074 153871842 212319165 598160856 73415828 553473971 656618554 551524775 985032893 989529495 859747397 908398545 562518825 228857552 292709852 850481663 67550033 999813755 780827970 838568532 9305159 535032734 371524020 960335014 53229310 926173807 56299221 354896500 532113414 877163460 326603106 110402402 636077133 469567560 557593562 503287309 568654720 637559609 315528802 438754908 976682156 51330689…
Output: 1 2 1 2 3 6 1 2 1 1 1 3 1 14 1 2 1 2 1 4 7 1 9 1 2 12 1 1 3 1 1 3 33 1 1 1 4 1 1 2 1 2 5 1 2 8 1 15 49 1 2 1 1 2 4 1 57 1 2 1 2 1 6 1 2 1 2 3 4 1 1 3 1 2 1 4 8 1 2 23 1 2 3 1 1 2 3 5 9 1 2 1 2 1 6 1 2 1 2 1 4 45 1 2 1 2 1 1 2 3 54 1 2 3 1 5 1 1 3 1 10 1 2 1 4 1 2 7 18 1 1 1 4 1 2 1 2 9 10 1 1 1 86 1 2 3 1 2 6 1 1 1 4 11 1 2 3 1 5 1 1 2 1 2 5 7 1 2 1 2 1 13 1 2 1 2 1 4 5 1 2 3 1 2 3 1 1 6 1 8 1 2 3 1 5 37 1 1 1 2 5 6 1 1 3 4 5 1 1 1 2 3 156 1 1 2 3 5 1 7 164 1 1 3 4 1 1 1 3 1 5 11 1 1 2 1 4 1 2 7 8 1 10 1 1 2 1 1 2 4 1 1 7 8 1 12 1 1 2 4 1 1 19 1 1 3 4 1 36 1 1 1 2 1 2 3 4 7 1 1 48 1 1 3 4 1 1 1 4 1 2 1 1 9 14 1 16 1 66 1 1 245 1 2 1 4 1 2 7 1 1 2 11 1 1 3 15 1 2 3 4 1 1 7 23 1 2 3 4 1 6 1 2 3 4 5 1 7 1 2 1 2 1 1 3 15 1 1 3 1 5 1 22 1 1 2 4 1 57 1 1 1 2 1 2 3 6 1 1 1 4 1 2 3 16 1 1 3 1 2 3 …

Example 3:

Input: 2813 365757242 48249259 697376676 9565084 69500501 103106470 777933054 380352330 921243713 354002722 889096866 386838142 573409969 565225811 417075562 482907463 121839144 521475640 302237816 799502248 129670906 762660577 24220159 234370733 461236798 466257896 909743818 263305269 136793570 965456199 437433862 222072426 924756769 665151610 845470980 762444964 548105186 721531641 579092524 988349530 295809195 219510157 699681941 242146387 160302143 497240651 830385729 996355630 906177178 913455180 859120068 253335152 416435555 723994584 161225496 328840282 899113044 386598450 619726782 734273836 538498242 17572305 136961310 524778298 53508452 652826326 21023824 435405349 231148368 196108123 263425612 879672610 982658500 527237566 8661114 228338190 24396954 896029746 760942997 400503213 436611…
Output: 1 1 3 1 2 3 7 1 9 1 2 1 2 1 1 2 1 4 1 9 1 2 1 2 3 4 18 1 1 30 1 1 3 1 2 1 1 2 1 40 1 1 3 1 1 3 7 48 1 2 1 1 2 3 1 2 7 1 2 3 1 1 2 3 1 6 1 2 1 1 3 15 25 1 1 2 1 5 1 1 2 3 4 6 1 1 2 10 1 2 18 1 1 1 4 1 1 2 4 1 28 29 30 1 1 1 2 35 1 2 1 4 1 1 1 2 9 1 1 12 1 74 1 1 2 4 1 2 1 4 5 1 1 3 1 2 6 1 8 14 1 2 1 1 1 3 1 5 9 1 103 1 2 1 4 1 2 7 1 1 2 11 1 2 1 4 1 1 2 1 2 1 1 7 9 25 1 2 3 1 5 1 1 8 1 1 1 4 5 1 1 8 1 1 3 1 2 1 48 1 1 3 1 2 1 4 1 2 1 59 1 2 1 1 5 1 1 3 9 1 2 3 1 1 6 1 2 1 10 1 2 1 4 1 2 3 1 1 239 1 2 1 1 3 1 1 1 1 8 1 1 11 1 1 16 1 2 1 1 3 4 1 1 7 1 1 2 4 5 1 2 8 1 1 3 1 2 1 15 1 1 2 4 1 21 31 48 1 2 1 2 3 4 1 1 2 4 1 1 1 1 4 6 1 2 1 1 2 12 1 2 1 4 25 1 1 3 1 1 2 4 5 1 2 3 4 10 1 12 1 1 2 4 1 6 7 1 2 3 23 1 2 1 2 1 4 33 1 1 3 62 1 114 1 1 1 4 1 2 7 1 2 1 2 5 1 14 1 1 2 4 1 2 1 2 1 2 7 1 1 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Ravi's registers Streak Back - MEDIUM Coding Problem | CodeTikki