CT48092

Twilight registers Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

It is audit day at the cliffside roost of Stormrest. Nandini spreads the registers records across the table and picks up a sharp pencil. 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: 479 549356903 10706876 268354321 876768518 204428108 49397004 875337890 661130629 985098673 726602642 384935264 693541510 122964675 719238347 604678205 605979803 599135630 27431904 581024901 526647108 666379161 893855140 817108577 132564766 171173041 176895828 336461164 110932444 747046858 441872928 462912368 528848084 403860459 262164998 720445515 807826103 895246293 705876875 100342588 463511110 968511093 773284739 273460966 114446083 918290012 515252676 112577386 442311911 285368025 875607099 194008474 404964060 225768464 49878056 715988973 510062189 890667987 949395446 441035001 652451223 451511616 117239674 514685370 103988732 948131317 86999389 149028652 490059428 157389968 32353396 833943660 617332636 862968309 849990506 514825337 847863369 302936105 902097412 211028678 590098613 44…
Output: 1 1 2 4 1 1 3 1 9 1 1 2 1 4 1 2 1 1 2 1 7 13 1 1 2 3 4 1 6 1 2 3 1 1 6 13 28 1 1 2 32 1 1 1 4 1 1 2 1 5 1 2 1 1 5 1 12 17 1 2 1 1 3 1 7 1 2 3 1 1 6 1 8 1 1 2 1 13 1 2 1 2 1 1 44 1 2 1 1 3 1 1 3 1 1 3 1 13 1 2 1 2 1 2 1 6 9 1 1 1 4 5 1 7 1 9 10 1 2 13 1 1 1 1 2 1 4 5 6 1 2 3 13 1 2 1 1 5 1 7 1 2 1 2 1 4 7 1 1 10 11 1 2 3 1 2 1 158 1 1 2 1 4 1 6 1 1 3 4 1 2 3 4 5 1 2 1 9 1 2 16 1 2 25 1 2 3 4 1 1 32 1 1 3 37 1 2 3 1 2 3 1 5 1 1 1 2 1 4 52 1 1 3 1 1 58 1 2 3 1 2 3 7 1 9 1 2 3 1 5 1 2 1 2 5 11 12 1 1 1 25 1 1 1 2 5 1 1 3 1 1 6 1 2 1 2 41 1 2 1 4 1 2 3 1 1 1 4 1 13 1 1 1 4 1 1 1 4 9 1 24 1 2 1 1 1 3 1 2 1 10 1 12 37 137 138 1 1 3 4 1 6 1 2 3 1 1 2 4 5 1 7 1 1 1 11 1 1 2 15 1 20 1 2 1 2 1 1 7 1 1 2 31 1 2 1 2 1 1 44 1 2 1 4 1 1 2 1 5 1 2 1 2 10 1 1 3 1 15 20 1 1 3 4 5 1 2 1 2 3 6 1 2 3 35 1 1 3 …

Example 2:

Input: 3884 366733576 747562545 517372211 972348764 798770865 462339579 487611427 52095055 171424249 394243833 559974057 61462045 164074111 16311068 163286832 429373247 822263925 543791308 500196398 483458798 597889003 749946662 520562017 155173435 68067347 520145859 306758383 887944041 85800697 139012642 893495775 101841858 781247205 118829254 782141272 313341080 746424042 138149904 424386561 630117340 202691780 241589521 784901469 843930589 613152713 527374144 307654204 455812884 322270875 304734742 785222026 265828128 193449528 386378690 848827058 152662663 224053927 624440360 173640410 750788602 300528949 511630860 72239568 432525181 281851830 488074522 567927634 562186729 939866717 709525132 264076390 204633841 470946605 310173383 279465200 529761613 237315057 119243631 516342755 586547459 4…
Output: 1 2 1 4 1 1 2 1 2 3 6 1 2 1 2 5 13 1 1 1 4 5 1 1 1 3 1 24 1 2 27 1 2 1 4 1 2 1 2 3 1 2 12 13 1 1 1 2 1 1 7 1 1 3 24 1 2 3 1 5 1 2 1 2 1 4 7 1 65 1 1 1 3 1 1 6 1 1 3 10 1 1 14 1 1 3 1 1 2 21 1 2 1 2 26 1 1 3 1 2 3 1 8 1 10 1 1 2 14 1 16 1 2 1 2 3 1 2 1 7 10 1 1 3 1 5 1 7 1 2 3 4 129 1 1 136 1 2 1 1 1 4 1 8 1 1 2 1 1 2 1 8 1 2 19 1 1 1 2 1 5 7 1 2 10 11 1 1 14 170 1 1 3 1 1 1 2 3 6 1 1 1 2 3 1 2 14 1 2 3 1 5 1 2 1 2 10 1 2 1 2 32 1 1 2 4 5 6 1 8 1 1 1 3 4 1 1 1 9 1 2 12 1 1 225 1 1 1 4 1 1 3 8 1 2 1 2 5 1 1 1 4 1 2 3 13 1 1 2 1 4 1 2 8 1 1 1 2 1 2 6 1 1 10 1 1 13 1 1 2 3 1 1 41 1 1 2 1 5 47 1 2 3 1 2 3 1 1 1 3 11 1 2 14 1 2 1 1 1 4 7 8 1 1 1 4 1 2 1 2 3 1 2 3 4 8 1 1 39 1 1 42 1 2 1 1 3 1 2 8 1 10 1 2 3 4 1 1 2 4 1 1 1 3 1 10 1 1 1 1 3 6 1 2 1 4 1 2 37 1 2 1 1 139 1 1 1 1 5 1 7 8 1 2 1 2 3 1…

Example 3:

Input: 3590 351933753 444680947 164944247 111843041 365358292 168910745 817843379 246976287 398457704 997749047 931427727 904311524 187699491 810234666 881698349 958825002 66506912 839375421 709250598 125503059 728693317 974937432 930027850 346558741 375684376 77436898 373581462 858909750 658583826 56891859 429487982 796132843 11202913 913274793 590519238 190296564 390116180 210181338 440838142 390729802 915421292 23947820 164253446 84582371 62507070 601916941 683180906 213719799 276367625 405082897 122075359 743683896 102983657 994607878 139548667 771035797 361772875 465148905 5528733 196234683 769619325 297464182 782965327 909899925 348394128 177198469 768134590 608673950 214022253 597744120 786171027 424106164 359991223 205790285 141437162 237693361 721112483 657702426 239562913 606698298 6198…
Output: 1 2 1 1 3 1 7 1 2 10 1 1 1 2 3 6 1 2 1 1 3 12 1 1 2 1 2 5 1 1 2 4 1 11 1 1 2 1 4 1 18 1 2 1 1 5 6 1 2 3 1 11 1 44 1 2 1 2 1 2 5 1 9 10 1 1 3 1 1 2 7 1 1 1 1 3 6 1 1 2 3 1 19 1 2 1 1 3 1 80 1 2 1 4 1 1 2 4 1 2 3 12 1 1 3 1 2 1 7 1 1 3 4 1 13 1 15 1 1 2 4 1 2 3 1 1 2 3 4 9 1 1 1 3 1 19 1 1 3 1 2 1 4 5 1 29 1 1 1 4 1 1 1 4 1 2 1 2 3 1 15 1 1 1 1 5 1 2 8 1 1 2 83 1 1 2 1 5 6 7 1 2 1 1 2 3 4 1 2 1 1 5 1 1 3 1 2 3 16 1 1 3 1 5 22 1 2 28 1 2 1 1 3 1 1 1 3 5 1 2 8 9 15 1 1 1 2 5 6 1 1 2 1 4 1 7 8 1 10 1 1 1 14 1 1 1 3 5 1 21 1 2 253 1 1 1 3 1 1 7 8 1 1 3 1 5 1 2 1 9 1 2 3 1 1 1 2 1 6 1 2 1 10 11 1 25 1 1 3 1 1 3 4 1 2 1 2 45 1 2 1 2 1 2 1 4 1 10 1 1 1 2 3 1 1 2 1 8 9 22 1 1 3 1 2 3 4 5 1 1 1 9 1 1 2 13 1 18 1 1 1 1 4 24 1 26 1 2 1 1 1 3 1 6 1 2 1 4 1 12 15 1 2 1 2 3 1 5 1 7 1 2 3 13 1 2 1 2 1 60 1…

Constraints:

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

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