CT53766

Silas's marks Reckoning

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Silas found an old ledger of marks in the signal tower attic at the lakeside town of Mirrormere. The margin notes pose a precise question. 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: 3743 353296016 36565562 876498116 834660239 144580936 548202516 46486102 333877029 158745600 388391352 600007204 56752201 928818172 617770966 570385485 170662719 227860055 102793257 523318418 691906919 941529779 301997105 883698660 765785459 589012356 953339997 229685429 511119396 413142806 543573661 849728399 178520339 452123851 285465113 29075377 939875821 899476713 457750370 977114097 618170493 544036896 295804540 958269075 754593848 428276787 989587751 587377480 19533931 584233751 328359639 992096289 754210058 779268814 162939807 404309951 846523509 878139163 357574778 162745729 991535972 780487546 590498255 471686562 915173534 954559314 820482148 589639476 808042546 677138322 975566151 683581975 923866919 521047923 723006027 719158057 962925166 557161964 814900666 200105402 952657223 …
Output: 1 1 3 1 1 2 1 2 1 4 7 1 13 1 1 1 2 1 4 7 21 1 2 1 1 26 1 2 1 4 5 1 2 1 1 10 1 1 39 1 1 1 4 1 1 46 1 1 2 1 51 1 2 1 2 5 6 1 1 9 1 1 1 4 5 1 1 2 1 10 1 2 1 2 1 6 1 2 1 4 1 1 2 3 1 1 7 1 1 1 91 1 1 1 3 4 1 2 3 8 1 1 1 12 1 1 2 4 1 2 3 21 22 1 1 1 2 1 4 1 1 7 10 1 1 1 3 5 1 2 1 1 2 1 1 8 1 2 1 1 5 6 7 1 1 2 1 2 3 4 7 1 2 1 2 1 4 1 6 1 2 9 1 1 165 1 2 1 2 1 4 1 8 1 1 2 3 4 1 7 1 2 1 4 1 1 1 8 1 17 1 1 3 4 1 1 2 1 1 2 11 1 2 1 1 2 1 5 1 7 8 1 1 13 25 26 44 1 2 1 2 5 1 1 1 3 5 1 1 2 4 1 60 1 1 1 4 5 1 2 1 1 10 1 1 3 4 1 2 3 1 1 3 4 1 1 14 1 2 1 28 1 30 31 100 1 2 3 1 1 1 3 4 9 1 2 1 1 5 1 2 3 1 1 2 1 4 1 1 8 17 127 128 1 2 1 1 5 1 7 1 2 1 2 12 13 1 2 1 2 1 1 5 21 1 1 1 2 1 5 1 2 3 1 5 1 162 1 2 1 4 1 2 1 2 1 2 5 1 1 1 1 2 4 18 1 2 1 4 1 24 1 1 2 4 1 1 7 1 2 1 11 1 2 38 1 1 2 4 1 1 1 4 5 1 1 8 1 1…

Example 2:

Input: 1701 180955320 269252813 423850188 558747435 305090895 791563197 511862525 756861205 327978912 839736149 427672168 763005832 248003687 75735154 187749462 581628723 125110059 552224210 929533037 653829906 28733250 129282541 815186732 107538150 655393951 485636866 689693808 573817704 815101000 978092859 902602655 66102873 93606234 636548338 428738471 733356012 554027923 344895962 464558559 116085167 728988374 335967648 421657357 638424089 442517580 151089223 643373715 137357051 863236112 375606468 884119248 713177114 203545302 875684067 364687001 539611185 281629053 293969126 661402900 215548872 979451241 38398585 998174036 750117566 603734185 340539786 494222028 916992000 647696452 485267830 324520865 28361292 496212261 814428423 927138473 726826051 976567798 709103237 891950931 284023244 6…
Output: 1 2 3 4 1 6 1 2 1 10 1 2 1 1 2 4 1 2 19 1 1 2 4 1 2 1 4 1 6 30 1 1 2 3 1 5 1 1 2 1 5 1 2 3 1 1 6 1 18 1 20 1 1 3 1 2 1 2 5 1 61 1 63 1 1 1 2 5 1 1 1 1 4 6 12 1 14 1 2 1 1 2 4 1 1 2 4 1 1 1 14 1 1 17 1 1 1 2 1 23 1 2 1 4 1 43 1 2 3 4 1 6 7 1 2 1 1 1 4 1 1 2 1 4 5 11 1 2 1 4 1 19 1 1 1 3 4 1 6 1 9 1 2 1 1 2 1 4 1 37 1 2 1 4 1 2 1 4 1 10 1 56 1 2 3 1 2 1 4 170 1 2 3 1 1 2 1 5 1 1 1 2 5 1 1 13 1 2 1 2 1 6 1 1 1 3 1 1 3 1 2 1 7 1 2 14 21 1 2 37 1 1 1 3 45 1 2 1 2 1 1 1 6 1 1 2 10 1 14 1 2 1 1 3 1 1 2 1 8 1 2 11 1 15 1 17 1 2 3 21 1 2 1 4 1 41 1 2 1 4 1 1 3 1 1 3 267 1 2 3 1 2 3 1 5 1 7 1 1 10 1 1 1 3 1 1 3 8 1 2 1 1 5 1 1 2 4 10 1 2 1 2 3 1 1 1 7 8 21 22 44 1 1 2 1 2 5 1 2 1 1 5 6 13 1 15 1 1 18 1 1 1 1 5 1 1 26 1 1 1 1 31 1 2 1 4 1 2 7 1 2 1 1 3 4 14 1 2 1 2 1 2 1 22 1 1 25 1 1 2 4 5 1 2 64 1 …

Example 3:

Input: 401 48862150 198987185 128931509 171740926 686389627 312582020 530660248 142386245 262418649 123882841 744581689 69719677 715106406 390456760 566468873 923419744 78955002 88946877 723731945 764613206 182831422 998534653 895069427 177070044 403756934 491224868 425638 374912237 563149983 20637473 34925421 423265247 45847288 649915620 975582890 209856133 574420701 727217494 518133196 448055464 348280952 904334914 858301593 259260952 210459739 384100838 166001496 4526667 96822988 952065842 311931878 638470996 571122429 271076369 314731932 500805245 894011050 858663622 877813170 489861120 214371776 849579564 439776670 798387817 234065070 114889495 433133863 553308352 832859800 952209098 679524919 560500491 424936187 423903234 921275118 158295641 357970266 27568117 429338315 742046502 725062852 …
Output: 1 2 1 2 5 1 2 1 2 1 11 1 2 1 2 16 1 2 3 4 1 22 1 1 2 3 1 2 6 1 2 3 1 11 13 1 2 3 1 1 1 7 1 1 1 3 1 1 2 15 1 2 1 1 2 3 7 1 2 1 1 3 1 2 1 1 3 4 7 35 1 1 1 1 5 1 2 1 4 5 1 1 2 4 1 11 1 2 1 2 1 2 1 4 1 1 2 10 1 1 1 14 1 2 1 4 5 1 2 8 1 2 1 2 3 14 1 1 1 18 1 2 21 1 55 1 2 1 1 5 1 1 2 9 1 1 2 3 1 1 1 2 121 1 2 1 1 1 3 1 1 1 4 1 12 1 2 1 4 1 1 2 1 2 5 1 8 1 1 3 4 1 1 2 4 1 10 1 157 1 1 1 4 1 1 2 1 1 3 1 2 1 10 1 2 1 2 5 1 2 8 1 20 1 1 3 1 5 6 7 1 1 2 4 1 33 1 1 1 2 4 1 1 202 1 1 3 1 2 3 1 1 3 7 1 12 1 2 1 4 1 2 3 4 1 1 7 1 2 1 11 1 2 1 4 1 2 18 23 1 2 3 4 1 1 3 8 1 1 11 1 2 3 4 1 1 2 1 2 6 7 12 1 2 3 4 1 18 1 2 3 1 1 1 7 1 2 1 1 5 13 1 1 1 3 1 2 3 85 1 1 2 1 2 1 1 2 6 1 1 3 10 13 1 2 1 1 1 6 21 1 1 1 3 4 5 1 29 1 1 117 1 1 2 4 1 2 1 8 1 10 1 2 1 1 1 4 1 337 1 2 1 1 1 1 7 8 1 1 3 12 1 2 1 1 2 1 5 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Silas's marks Reckoning - MEDIUM Coding Problem | CodeTikki