CT37697

The Streak Back of Leatherwick

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the tannery row of Leatherwick pays by the answer, and Nils intends to earn it. First: the full register of beacons. 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: 913 805046477 77012416 596000997 383736446 885309986 726433401 233517322 391304412 171908562 837002 771338613 622457898 314934862 8721672 933050062 99424681 755560378 831365931 886306816 108505945 708905856 777867467 90567811 702171404 486387752 532003592 517307019 629215416 219459529 229200538 178568073 703868724 664405834 75501028 718346329 278031423 667027862 962290109 52339011 176510744 24289887 292278669 575804261 323632462 601381916 244282793 291949281 533221516 819168902 339580523 969802845 9531199 361320742 199712894 846934282 957920918 837811786 852651457 462962511 288952101 896850989 941317064 430747636 633675650 278159310 885429866 113359582 456578440 774307532 95247437 460335393 478027000 113184181 197217240 36458806 434610283 127083510 95518880 182914675 667203743 76829877 450…
Output: 1 1 2 1 5 1 1 2 1 1 6 1 1 1 15 1 2 3 4 1 2 3 1 2 1 2 1 4 1 2 1 10 1 1 13 1 2 38 1 2 1 4 5 1 7 1 2 3 11 1 51 1 2 1 4 5 1 2 1 1 5 6 1 2 1 4 1 2 3 1 2 3 1 2 1 4 1 1 3 11 1 2 17 84 1 2 1 2 1 2 7 8 1 2 1 2 1 4 15 1 2 1 1 1 2 4 1 6 1 2 1 4 5 6 14 17 1 2 1 2 3 1 24 1 2 1 2 1 4 5 1 1 1 9 1 2 1 1 1 3 7 1 2 3 4 1 1 3 4 1 2 7 8 1 10 11 1 1 2 3 20 1 2 3 1 1 1 7 8 71 87 1 2 1 2 5 1 1 3 9 1 1 2 4 1 1 7 1 1 1 2 1 4 1 2 1 8 11 12 1 2 1 2 3 1 7 1 2 1 4 5 1 1 2 4 1 2 3 1 2 1 4 1 6 1 1 3 10 1 2 3 1 2 3 1 37 1 1 1 3 4 6 1 2 1 2 11 77 1 2 1 1 1 4 1 1 9 1 1 1 3 1 2 7 17 1 2 1 4 5 1 2 1 1 1 6 1 2 1 4 1 12 13 1 1 1 4 1 1 1 1 22 1 1 3 1 1 1 3 1 2 6 7 1 2 1 1 1 6 1 1 2 10 1 2 1 4 5 6 1 1 57 1 1 1 3 1 2 1 4 1 1 7 12 1 2 1 2 3 1 19 1 2 22 1 1 3 26 1 2 1 2 3 4 5 1 1 10 1 112 1 1 3 1 1 3 1 8 1 2 1 2 1 2 3 8 1 2 1 12 1 …

Example 2:

Input: 2539 205526492 909221422 633873425 794447960 255389854 463594876 956777849 861569678 64816643 468414349 765553324 137138621 897480343 717403446 826542293 741570301 166218996 232556449 835372112 124096663 517045399 972403486 849722409 199620566 576969230 409637166 465164426 42762756 513320428 254160518 173371281 449041499 486067992 784036601 251759641 909101943 569402027 277916320 822140940 532837022 794766579 254620743 926634061 508719837 402309073 425030729 147627234 119147533 441764992 873629287 59878511 558391357 792482725 637470290 276640678 359047511 853859514 79184711 178956535 51763650 526663072 339607779 351182428 391377483 211230933 637440522 842805034 520526950 204001447 67634469 808748976 886853085 466379397 129250921 325975595 102967461 70984374 904562365 886021983 56282679 966…
Output: 1 2 1 2 1 2 7 1 1 2 3 1 6 1 2 1 1 2 6 1 2 22 1 1 2 1 2 1 4 1 1 3 4 11 1 14 1 1 3 1 2 1 21 1 1 2 1 1 5 7 1 2 3 1 1 2 7 1 2 1 4 1 2 3 1 9 10 1 1 1 4 29 1 1 2 1 1 35 1 1 59 1 2 3 85 1 2 1 2 3 6 1 2 1 10 1 2 3 1 5 1 2 3 4 1 1 1 4 1 15 1 1 2 1 4 1 6 1 2 1 2 1 28 1 2 3 1 1 3 4 1 2 1 2 1 13 1 1 54 1 2 1 1 5 1 1 2 1 1 1 4 5 1 2 1 1 1 2 4 1 9 1 2 1 20 1 2 1 1 3 1 2 3 4 8 1 2 93 1 1 2 3 5 1 2 3 1 2 6 1 1 3 1 1 2 18 1 1 3 1 2 1 1 8 1 2 3 1 2 6 1 1 2 18 1 2 1 2 5 1 7 1 1 1 3 4 1 1 3 9 35 1 2 3 39 1 2 1 2 1 6 1 1 2 4 1 1 2 4 9 16 17 1 2 1 2 1 2 1 2 3 1 1 1 7 1 15 16 1 2 1 37 1 2 1 2 99 1 194 1 2 1 4 1 1 2 4 1 6 11 1 1 1 3 1 5 6 1 8 9 1 2 3 1 2 1 4 1 2 10 11 1 13 1 2 1 2 18 1 1 1 4 1 6 35 1 1 1 39 1 2 3 1 1 2 3 1 2 6 1 2 9 1 11 1 2 1 2 1 6 18 20 1 1 1 1 1 5 1 1 32 1 1 3 4 1 1 2 3 1 371 1 2 3 1 1 1 4 5 1…

Example 3:

Input: 2731 657450799 518507152 411865061 112570252 726821088 171168240 932312959 835827773 765961626 393777737 338495004 844431300 572114950 142533324 186514791 900768705 913129278 654008130 924344676 13265069 20396116 964556276 899485176 749161324 993717304 626458022 324806044 315482682 137676681 108312102 233587083 654916814 603503719 942234706 157194447 690667235 276447943 539343871 317243395 235046066 829173374 692549556 810310072 541925809 623905638 461690556 824800861 471384928 78806159 953101427 625596639 73385250 64230913 465249572 396152535 821695369 429473075 965075943 871148722 662480142 943031331 293050138 286402064 259260520 91490505 199575847 676373235 823806576 699792239 434067489 679614990 426608618 857783866 268892631 462325287 800478273 961063758 636633280 100617496 596009938 8…
Output: 1 1 1 1 5 1 7 1 1 1 1 5 1 1 2 9 10 1 12 1 2 22 1 1 25 1 1 1 1 1 3 7 1 9 1 2 1 2 1 1 7 1 2 1 2 1 6 1 1 25 1 1 1 3 1 6 1 33 1 1 3 1 1 1 1 2 6 7 1 1 2 1 12 1 2 3 19 1 1 2 1 5 1 2 1 4 1 2 3 1 14 1 1 3 4 1 1 3 1 1 3 4 1 2 1 1 5 6 1 1 3 1 22 37 1 1 3 93 1 2 1 4 1 2 1 2 3 6 1 1 2 1 15 1 1 3 19 1 1 2 1 142 1 2 1 1 2 3 1 1 2 1 4 12 1 14 1 1 2 1 4 1 2 1 1 2 3 7 1 14 1 2 1 2 1 6 1 1 2 4 1 1 1 2 4 1 2 3 4 9 1 2 3 1 2 16 1 2 1 2 5 6 1 2 1 4 1 2 7 8 55 1 1 1 4 1 1 1 4 1 2 1 4 1 2 3 1 2 6 11 1 2 1 1 24 1 2 3 1 1 3 7 1 2 3 4 1 2 3 1 2 3 1 1 6 114 1 1 3 1 1 2 4 1 1 1 2 5 1 2 3 4 1 2 1 13 1 1 3 17 25 1 1 28 1 2 3 1 1 2 1 2 9 1 2 12 1 1 1 1 5 1 1 3 21 1 2 1 4 5 1 1 3 9 1 1 2 4 1 2 3 1 2 3 1 42 43 1 1 2 3 1 5 1 1 3 4 11 1 1 1 3 1 5 1 2 3 9 1 1 1 13 1 2 1 4 1 2 1 4 1 10 1 1 1 14 1 2 31 1 33 1 2 3 1 2 3 1 2 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 Leatherwick - MEDIUM Coding Problem | CodeTikki