CT49584

The Streak Back of Balmcrest

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the cedar groves of Balmcrest as Ulrica unrolls the day's manifest of registers. The tally will decide the next shipment. 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: 2511 219357731 39773716 456400085 322476095 138478824 760237148 558643603 560272739 638202526 524625398 373894558 474558638 61091337 222227248 241224168 865206301 336207490 561501325 544363689 809956323 794429876 975528716 455891384 654488832 230365861 47199472 256893266 330352941 400286608 826523218 834982958 476488736 428857569 262891969 547556512 100806258 701216676 7012068 366842502 124169537 1307653 743504117 822458570 569703834 936151793 30880982 603589081 411790486 728314114 933747821 184486224 913592674 891818841 700319741 167206936 488481072 437521897 124674677 199495361 415284349 5804140 683667627 903067014 766866796 582769861 312331293 297456993 772752365 562061396 770755096 745611041 655306122 959092471 458402332 660439566 423578256 14897366 36506413 820162352 175873630 4116339…
Output: 1 1 3 1 1 6 1 2 3 1 1 2 1 2 3 16 1 2 1 4 1 22 1 2 1 1 3 4 5 8 9 1 1 1 4 1 6 1 2 1 1 11 12 1 23 1 2 1 4 5 1 2 1 1 1 2 1 1 2 3 1 8 11 1 1 1 1 5 1 2 1 1 51 1 2 1 1 2 6 1 2 1 4 1 6 7 14 1 1 1 1 2 6 7 1 23 24 1 1 2 3 1 1 3 1 33 1 1 3 1 5 1 1 1 4 10 1 1 13 1 2 3 4 18 1 1 2 3 1 5 6 26 1 1 1 4 5 6 7 1 2 1 11 1 2 146 1 1 2 1 4 1 1 2 9 1 2 1 1 2 3 5 1 1 2 3 1 13 1 1 3 4 1 174 1 1 2 1 2 3 1 1 2 4 5 1 1 3 1 10 1 2 1 4 1 2 1 2 9 1 1 3 4 1 1 1 1 1 4 1 6 1 2 1 4 1 27 1 1 3 4 5 6 1 8 1 2 54 1 1 2 4 1 1 1 3 5 6 1 2 1 4 1 6 17 1 1 2 3 1 1 24 1 1 27 1 2 1 1 3 1 2 1 1 3 6 1 2 3 1 1 15 1 2 3 1 2 6 1 23 24 1 26 1 2 1 4 5 1 7 1 2 1 2 1 4 1 6 1 17 1 1 1 4 1 1 2 1 2 10 1 2 3 4 5 1 2 1 36 1 1 2 4 96 1 1 2 4 1 2 7 1 1 3 1 2 1 110 1 1 2 1 5 1 1 3 1 10 1 2 1 4 15 1 1 1 3 1 2 7 1 1 1 2 5 6 1 2 1 4 1 6 145 1 1 1 4 1 1 3…

Example 2:

Input: 2363 857897516 550388265 800317195 423474851 828972881 396367618 709414344 918143329 456709298 730819149 2598206 154465788 144407521 73775748 276830752 926165066 608029838 446713366 759589580 966020798 107223325 566809697 72512445 159652680 891509837 623636390 44155950 744868737 942562554 711747483 965820833 561334570 948334479 475262411 606404116 606735205 235583241 413646809 393091311 426285848 767630307 163139480 444004620 729526175 338789441 757164928 542216440 651900793 976400971 397436354 896992450 652118304 504646544 210940754 892359696 427241326 629194690 536724932 617898713 591185202 680881144 225411525 819242857 499241245 522724666 54241462 403732804 528141795 204691286 469891757 618750432 928693285 420110779 508798871 171357802 426306197 526302358 999090294 118170701 530019223 2…
Output: 1 1 2 1 4 1 2 8 1 2 1 2 1 1 5 16 1 1 3 20 1 2 1 2 5 1 1 3 9 1 11 1 2 1 2 3 1 2 1 4 8 1 2 3 1 5 1 2 49 1 2 1 1 1 4 1 2 1 2 1 6 1 8 1 2 1 2 5 1 2 8 23 1 2 1 2 5 78 1 2 1 4 1 1 3 8 1 1 1 3 4 1 1 1 17 1 2 20 1 1 1 3 1 5 1 2 1 1 1 4 1 34 1 2 1 4 1 1 2 4 43 1 2 1 1 1 6 1 2 1 53 1 1 3 4 1 1 1 1 62 1 1 3 1 2 1 1 3 1 2 1 4 1 11 77 1 1 1 4 1 6 1 1 2 3 1 1 2 1 15 1 2 1 1 5 1 2 1 1 2 3 12 1 2 1 4 1 2 1 2 3 4 5 8 1 2 1 2 1 1 2 47 1 2 1 1 5 1 2 1 4 5 1 7 1 2 10 1 2 3 4 1 6 1 1 3 149 1 1 2 1 4 1 2 3 1 1 2 3 5 13 1 2 1 2 1 2 20 1 2 3 25 1 1 1 29 1 31 1 2 1 4 1 2 3 1 1 2 4 8 1 1 1 4 1 6 1 1 3 4 54 1 1 1 2 1 2 1 7 1 2 3 1 2 13 1 1 1 4 1 2 21 1 2 1 2 1 4 1 6 7 8 1 2 3 14 1 1 2 4 1 2 1 1 3 1 7 250 1 2 1 1 3 1 2 6 1 1 3 1 5 14 1 1 1 1 2 1 7 22 1 2 1 2 3 28 1 2 1 1 2 1 5 6 7 1 2 3 1 1 3 1 1 2 1 4 9 1 2 3 1 1 18…

Example 3:

Input: 2085 870544514 700734894 513997250 592856697 843868495 425888145 763852159 343772095 397181594 697572730 931824153 279525452 352281536 421052339 656313731 143783089 127343934 959389677 242860458 625070217 559714588 894310934 759701181 227816363 958965104 632310571 540064975 489618962 372123380 783557680 677505438 664585973 170735914 427905395 862816291 957673377 547756975 924657718 563945780 384416084 712931075 287421383 338657245 221265608 17595416 332541786 296754844 188239396 373306501 741837168 973977305 959031703 205757106 436378881 879425899 116951972 650780081 788559246 716516608 942705583 240872051 731883759 80260892 218246454 722387703 745171491 248588588 298686228 62112147 319509919 388466220 65108645 393855693 893944889 634423119 881878818 70877884 84497824 893146513 512175180 2…
Output: 1 1 1 2 4 1 2 1 2 3 11 1 2 3 4 1 1 18 1 2 1 4 1 1 7 1 1 1 1 5 1 1 1 2 10 11 1 2 1 1 3 1 2 1 1 3 1 1 8 12 51 1 1 2 3 1 2 3 1 8 1 2 1 2 3 6 1 2 1 4 5 1 7 14 1 2 1 2 5 1 1 3 1 1 2 3 5 1 2 1 1 1 11 1 1 1 4 1 39 1 1 2 1 104 1 2 1 2 3 6 7 1 2 3 1 2 1 7 15 1 2 1 1 3 1 1 3 9 1 2 27 1 2 1 4 1 1 2 8 1 2 1 2 1 6 1 1 3 4 1 1 1 4 1 6 11 53 1 1 1 1 2 1 1 7 1 63 1 1 2 1 2 69 1 1 3 4 1 2 7 1 1 3 1 1 6 1 2 3 1 2 3 7 1 9 10 93 1 2 1 4 1 1 2 1 4 1 2 3 1 5 1 12 1 2 3 1 1 2 7 24 1 2 1 1 5 1 228 1 2 3 1 2 6 1 8 1 2 1 4 5 1 1 16 1 2 3 4 1 6 1 1 3 1 1 6 1 2 1 2 11 1 1 2 3 1 1 7 1 1 43 1 1 1 2 1 2 3 1 8 10 1 2 1 1 5 1 2 1 2 5 6 1 1 3 4 1 1 2 1 4 1 7 1 2 1 21 1 38 1 1 1 1 5 1 2 1 2 3 4 1 2 52 1 2 3 1 2 58 1 1 1 4 1 1 3 4 9 1 1 2 4 1 1 1 2 1 19 1 1 3 1 1 1 2 5 1 2 30 1 1 2 1 5 1 7 1 1 2 3 4 5 1 7 8 1 1 1 20 1 1 3 1 …

Constraints:

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

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