CT38197

The Streak Back Beneath Cindercrag

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

At the ember mines of Cindercrag, Leon records each ledgers in a worn leather ledger. The guild wants answers, not guesses. 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: 1387 632421726 504471023 544244457 668086789 723066729 651874005 736969404 952783766 442120020 298654909 617323638 435194309 903879359 999979040 844512644 220606472 386039073 305666293 688616043 368204214 650417492 516474197 742518179 999078965 947816729 95431886 117844592 826714245 416769575 163650523 317662764 189226697 537705178 798250598 617794891 887590161 996338291 12141358 859263787 885995895 771670922 271904757 747915022 587367406 144453092 498468980 137061387 355663080 212969239 848211296 841095499 545758564 748123257 823505105 879675608 993901130 10189298 499289260 998282501 763881112 383715939 924650196 103009024 577960120 996784426 325695340 543551956 751592888 127547569 462664392 903170395 578138279 755954337 772418271 869517881 799516537 549329371 984419067 12337254 591382800…
Output: 1 1 2 4 5 1 7 8 1 1 3 1 5 14 1 1 2 1 4 1 2 1 8 10 1 1 2 3 1 1 2 1 5 6 1 11 13 1 2 3 1 1 2 1 1 2 1 2 1 10 1 1 2 3 15 19 1 2 35 1 1 3 1 2 6 1 2 3 1 2 6 1 2 3 4 1 1 13 1 2 3 4 5 1 7 21 1 2 1 1 1 4 1 6 1 1 3 4 5 1 15 1 1 2 3 20 1 2 1 1 5 1 1 3 9 1 1 2 4 1 6 1 17 1 2 1 2 3 1 1 8 1 1 1 2 3 1 1 8 1 10 118 1 2 1 1 1 2 3 1 1 1 3 4 9 12 15 1 17 1 1 2 4 1 2 1 1 1 3 1 6 30 1 2 3 4 1 6 1 2 1 1 1 6 1 8 1 2 3 1 5 20 21 1 2 1 1 2 1 1 6 1 1 2 3 1 5 1 2 1 4 11 1 72 1 1 2 3 1 1 3 1 8 1 1 11 1 1 3 1 2 6 1 1 1 4 5 6 1 2 1 1 3 1 2 1 1 5 17 1 1 3 4 5 1 2 1 4 1 2 1 2 5 32 1 1 2 1 5 1 1 3 4 1 61 1 1 1 4 1 1 3 1 9 1 2 3 1 5 1 2 17 1 2 1 4 5 1 2 1 2 5 6 12 1 1 32 1 167 1 2 1 4 1 1 2 8 1 2 1 2 1 2 3 6 1 8 1 10 1 1 1 4 5 18 1 1 1 2 4 6 1 2 1 1 11 12 1 2 15 1 2 1 2 1 2 1 2 3 4 1 1 3 1 2 10 1 14 1 2 19 1 1 39 1 1 2 4 1 …

Example 2:

Input: 594 147468129 849158523 348375062 863367200 350369201 294745971 758510681 559240500 138154295 624576426 465461527 488601037 936567968 741018875 845446261 61431211 836866106 347588891 556280755 972849357 279003875 244060326 456822189 976715491 430926903 816888946 203834899 405798636 672946634 342828720 851764001 402660144 587146823 621453796 94499813 31839374 835685879 308462283 510784333 528733965 158433667 685128177 385879631 274891500 679955429 904689125 426518606 259753687 1284281 716434207 512679172 960242221 206423244 716734314 61286976 821665941 445812238 930770881 837967425 900116174 344271692 567906247 501354517 181811270 123816059 378126859 465264926 84376763 969252697 426722533 473077273 979189642 988823000 557767252 211417714 364886802 197861083 575197097 662715665 147857987 920…
Output: 1 2 1 4 1 1 3 1 1 3 1 2 13 1 2 1 2 1 2 20 1 1 3 24 1 2 1 2 3 1 7 1 2 3 1 1 6 1 2 3 1 5 1 1 3 22 1 1 1 4 1 28 1 2 1 4 1 6 1 2 1 2 1 1 1 3 4 1 45 1 2 72 73 1 1 2 1 5 6 1 1 3 4 1 12 1 1 3 1 5 91 1 1 1 3 1 5 7 1 2 3 1 5 13 1 1 3 17 1 1 2 3 1 1 3 8 1 2 1 12 1 122 1 1 3 1 1 6 1 2 1 1 1 6 7 1 2 1 4 1 1 1 8 1 1 2 4 1 1 3 1 1 6 1 2 1 2 1 2 25 1 2 1 4 1 2 3 1 1 1 7 1 2 1 1 3 4 1 1 20 53 1 1 2 4 1 2 3 1 2 1 1 3 9 1 1 3 17 1 2 1 1 3 82 1 2 3 1 1 6 1 1 3 4 1 2 7 1 2 1 1 12 1 20 1 1 3 4 1 1 7 1 1 3 1 1 3 14 35 1 2 1 1 3 4 7 1 2 1 4 1 2 1 1 5 1 7 1 1 2 11 1 1 2 4 1 2 1 4 1 2 1 8 1 1 37 1 1 3 1 5 1 7 45 1 47 1 1 3 1 2 1 2 5 1 7 1 1 3 4 1 1 3 1 9 1 1 3 1 1 6 73 1 110 1 2 1 2 1 2 5 1 2 1 11 1 13 1 2 1 2 1 1 3 1 1 2 3 1 1 3 1 5 1 2 1 20 1 35 1 1 3 4 1 151 1 2 1 1 3 1 1 2 3 5 9 10 1 2 1 1 3 1 2 1 4 10 1 2 25 …

Example 3:

Input: 3744 33959325 792273680 26221698 748855792 270047641 936000784 64403369 94930779 876636955 114971801 792713711 286659795 556637810 387314744 748342452 579324814 677808726 353960960 209579712 527338005 971338194 808719744 173956098 660372949 530168012 23559020 462538698 521168278 766950379 430510876 341052308 965078725 264835525 757942740 106668995 895580662 752656259 700835641 538652420 311720425 875105446 976356240 898612613 940182767 192954915 110639531 606277589 565313151 976980025 322645424 487368139 25147665 747467213 935623370 491608785 793980512 359631581 179552611 950006691 694610380 151446120 728856313 559159158 393846061 686622650 542737843 26135916 748323005 4598510 904536548 350409948 166922376 400999780 776323082 876940195 886600566 572327043 491000748 73724595 778839450 82182…
Output: 1 2 1 2 1 6 1 2 3 1 2 1 2 1 4 1 2 1 1 3 21 1 1 2 1 1 2 3 7 1 1 11 1 2 1 4 1 1 1 1 5 42 1 2 1 1 3 1 49 1 2 1 4 5 1 2 1 1 10 1 1 3 1 1 3 1 1 9 1 11 1 1 3 4 5 6 1 1 1 4 5 6 34 1 1 2 1 4 1 6 7 9 1 1 1 3 5 1 1 1 2 53 1 1 2 1 2 3 1 5 9 1 1 1 3 4 15 1 2 1 1 1 2 3 4 1 1 3 8 1 1 2 4 1 2 17 1 1 1 3 5 25 1 2 145 1 2 1 2 3 6 1 1 9 1 1 3 4 1 1 3 1 2 1 1 8 1 2 3 1 1 2 4 1 9 1 19 1 25 1 2 1 1 5 1 186 1 2 1 2 3 1 5 1 1 3 1 2 6 1 201 1 2 3 1 1 2 1 1 2 1 1 2 1 2 1 13 1 2 1 2 3 1 2 24 1 1 3 1 1 3 1 5 1 34 1 2 3 1 1 6 1 1 9 1 11 1 13 1 1 2 4 1 19 1 2 3 1 1 2 4 27 1 2 1 4 1 2 3 1 1 2 1 1 1 10 15 1 2 3 1 2 6 1 2 1 2 1 12 1 1 15 1 2 1 1 3 97 1 2 1 1 1 3 4 5 6 10 1 1 3 1 1 3 1 1 9 1 1 1 1 5 1 16 1 1 3 1 5 1 1 1 2 1 4 7 13 1 15 1 1 1 2 5 1 2 1 1 1 1 4 5 7 1 16 1 1 1 4 1 2 1 4 25 1 1 3 4 1 2 3 8 1 1 77 1 2 1 4 1 2 …

Constraints:

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

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