CT44964

The Streak Back Beneath Emberfall

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The archivist Ojas has been asked to settle the inheritance fairly. On the desk lies a long table of beacons 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: 3543 655514034 878170418 1018227 515392974 898643637 365646605 965220413 379579102 359464857 46398119 516263269 803447903 843099635 459046170 711788045 604936709 124598989 308685054 119143511 625468319 124224733 956094786 772290478 445210575 619050747 699210733 246298427 142358826 419261146 25492348 401285237 891327716 232929468 391503869 126167979 561665950 502678181 706253981 440209512 127914919 426798800 933524534 917575343 379290238 332511109 327613861 462004543 311501870 770256378 40675324 331950372 300231186 788800534 551679197 358238482 742458866 808249671 185404684 737830730 170633901 749128390 769935156 900979554 551361950 662888523 277917133 480472296 49888292 767413257 660047584 108474368 224023661 759080860 581907209 832476304 605557282 260270764 587743527 80528188 373958995 97…
Output: 1 2 1 2 5 1 7 1 1 1 4 5 6 1 2 1 1 2 1 5 1 15 1 1 2 3 1 1 3 1 2 10 1 2 1 4 1 6 1 1 2 20 1 1 1 1 4 1 6 1 2 1 10 1 1 3 14 1 2 1 4 5 20 1 2 1 2 1 6 1 1 2 4 1 12 1 1 2 1 2 81 1 2 1 4 1 6 1 8 1 2 1 4 5 1 1 16 1 1 3 20 1 2 1 1 2 1 1 5 6 1 1 3 1 2 1 1 3 15 1 1 21 1 23 44 1 2 1 2 5 1 7 1 53 1 136 1 1 3 1 2 1 1 1 2 1 1 2 4 14 1 1 2 1 1 3 7 1 1 3 11 1 1 3 4 1 2 18 1 2 1 4 1 1 2 3 1 6 7 1 1 1 15 1 2 3 1 1 6 1 1 9 1 1 59 1 2 3 1 2 3 1 5 1 1 1 9 1 2 1 2 1 1 1 2 5 1 2 1 4 1 2 3 29 1 1 2 1 1 5 1 1 3 1 1 11 1 2 14 1 1 3 1 2 6 1 8 1 1 55 1 2 1 1 1 3 4 1 6 1 2 1 11 1 2 14 1 18 1 1 1 2 5 1 1 8 82 1 1 2 3 1 6 1 2 1 1 2 1 7 1 1 16 158 1 2 297 1 2 1 1 3 4 5 1 2 1 9 1 1 1 2 1 17 1 1 1 4 1 1 1 2 1 6 1 1 2 1 2 5 1 1 8 1 1 2 1 2 5 15 1 2 1 19 20 1 2 348 1 2 1 2 5 6 1 1 1 3 1 1 1 3 5 10 1 2 1 4 1 2 3 8 1 2 1 2 23 1 1…

Example 2:

Input: 3503 49366330 95657357 976530759 184336476 181075861 622232147 957515714 928974276 802393497 420931386 737805024 426007499 675532150 320448857 837306506 200259140 850111330 796350173 604938217 654443506 255321335 595327909 556976726 68329016 251630552 913484256 644244362 506644036 269307683 110885615 247713248 857430084 403728381 796784453 687508303 708694744 620397220 557488993 470180015 313615053 742293990 84964328 699633834 732310187 146863370 362669563 31764224 349735844 390051815 465342444 81842966 87946460 180559716 3415831 664365394 277749777 221047922 188890044 99140934 276757290 637249722 252437110 221032579 333858724 166709051 910864664 515774565 109497194 409989296 224592310 528942928 595526693 43299769 406947599 14970000 453031160 846115335 410250730 487479185 798804055 8626260…
Output: 1 2 3 1 1 3 4 1 1 1 2 1 2 1 7 1 9 1 1 2 1 2 1 1 2 18 1 1 1 1 2 6 1 2 1 2 1 1 1 1 7 1 2 3 1 2 1 2 5 6 1 2 3 1 11 1 1 1 1 4 6 1 1 3 1 40 1 1 2 1 5 6 1 2 1 4 11 1 2 3 15 1 1 3 1 2 3 4 8 9 1 84 1 2 1 2 5 1 2 1 98 1 2 1 4 1 1 2 1 1 2 3 8 1 1 2 4 1 14 1 1 2 3 4 1 2 1 8 9 1 26 1 2 1 4 1 2 1 2 1 1 3 1 2 1 1 3 1 12 15 1 2 22 1 155 1 2 1 4 5 1 2 1 1 2 4 12 1 1 15 1 17 1 2 1 1 2 3 4 1 6 1 1 2 1 12 1 1 15 1 1 2 1 20 1 1 1 4 5 6 1 2 1 1 1 6 1 2 15 1 1 1 1 4 1 42 43 1 2 1 2 1 4 1 1 3 10 1 74 1 1 3 4 5 1 2 1 2 5 1 1 3 1 1 3 4 8 1 1 3 12 18 1 1 2 4 1 2 1 1 2 1 1 5 13 1 2 1 2 5 1 7 1 2 1 2 3 1 1 1 3 5 11 1 2 1 58 1 1 3 1 2 1 4 8 1 1 3 1 1 1 3 16 1 1 1 3 4 5 1 2 8 1 2 12 1 1 2 4 1 6 1 1 3 1 2 1 173 1 2 3 4 1 1 3 4 1 2 3 4 1 6 7 16 17 1 19 1 1 2 1 5 1 1 3 4 1 6 1 2 1 4 1 1 13 1 1 3 4 5 1 7 1 1 2 4 30 1 1 3 1…

Example 3:

Input: 1800 189045039 686770169 652974879 310127670 652652602 837295094 920890240 891511779 502787077 581117406 811030158 562225125 62853120 509889772 622310480 858204465 476199033 506462871 349131600 518456942 896390620 803763620 777016675 924521084 563213517 964886920 705479049 414576997 289814810 691602596 324833461 73789679 724512219 161278434 305051691 985767372 924833105 286791049 593260003 908091863 351271774 562243470 938611805 24178756 636199497 285179971 100701647 466619713 38728870 211941321 197425406 281630082 773048808 731800946 664562570 132996441 927824498 827984349 221649565 557420435 596687682 952558935 817876012 794398860 398043277 80410677 883332428 647560813 850236951 484181743 390983862 77311181 697473455 50200374 111049613 655580588 847725521 831523444 937179120 323461434 88…
Output: 1 2 1 1 2 6 7 1 1 2 3 1 1 2 4 8 1 2 1 4 14 1 1 24 1 26 1 1 1 3 1 1 7 1 2 36 1 1 2 3 1 2 7 1 2 1 1 3 1 2 1 4 10 1 1 1 14 1 1 2 3 26 1 1 1 1 5 1 2 1 1 1 4 1 2 3 8 1 17 1 2 1 1 5 1 2 3 4 53 1 2 1 2 1 1 3 6 1 1 9 12 13 1 1 3 1 18 1 1 1 1 4 5 1 1 2 117 1 1 2 1 2 5 1 8 1 1 3 1 2 1 2 3 1 7 8 9 10 11 1 1 1 26 1 1 1 3 1 32 1 1 2 4 1 1 2 3 5 1 1 3 1 10 1 1 17 1 1 20 1 22 1 2 1 4 5 1 2 1 9 64 1 2 1 2 1 1 1 8 1 2 1 2 3 1 7 1 1 199 1 1 3 1 1 1 7 1 1 1 3 5 13 1 2 3 1 2 1 7 8 1 1 1 2 3 6 1 2 1 2 3 1 7 1 9 1 25 1 1 1 1 5 6 1 2 3 4 1 2 1 2 3 1 5 6 1 1 3 10 1 2 3 1 5 6 19 1 25 1 2 3 1 1 2 7 1 1 1 11 1 1 2 1 5 6 1 1 1 3 1 2 1 2 1 9 1 1 2 3 32 1 1 35 1 2 1 1 2 1 73 1 1 2 3 1 1 3 1 2 1 10 1 13 1 1 3 1 1 2 4 1 1 1 1 3 4 7 12 1 1 3 4 131 1 2 1 1 2 1 7 1 2 1 1 1 4 1 1 1 3 5 1 2 1 1 1 4 5 8 1 2 3 21 1 1 1 27 1 2 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Streak Back Beneath Emberfall - MEDIUM Coding Problem | CodeTikki