CT36057

Lunar ledgers Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the tannery row of Leatherwick as Innkeeper unrolls the day's manifest of ledgers. 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: 473 360593733 939313054 336560241 136995372 999759310 746971822 165012698 431240627 720013305 373260213 30941173 205801566 504950210 748969346 54179271 84665796 55656439 253840743 464411107 748450038 121914477 538462864 199619867 402504314 964920093 290697272 209547560 225746246 311288569 794826064 164483361 65711304 915796506 446227129 373156750 964804251 729661169 465716193 94072602 183982248 993774775 258427208 400159725 803816108 286210088 129787406 678015208 128353850 688043318 194534841 222938864 534297560 653469187 164994127 203243637 26710434 461747217 19673364 286260748 809949562 83153135 837798776 528828454 236941424 594308993 826760920 722779159 879476359 793466335 935065008 154019598 784233252 640487745 246046896 672557892 564987957 506772790 887282562 589265041 74686631 470758…
Output: 1 2 1 1 5 1 1 2 3 1 1 2 4 9 1 2 1 4 5 6 1 2 1 2 20 1 1 2 4 5 1 1 8 1 1 11 1 1 1 2 36 1 2 3 1 1 3 1 5 1 2 3 4 1 2 1 4 1 2 19 1 21 1 1 3 4 1 27 1 29 1 2 1 1 3 1 1 8 1 1 1 4 1 1 1 1 5 1 1 1 4 14 1 16 1 1 3 1 1 59 1 2 1 1 5 1 1 2 9 1 1 1 1 2 3 1 2 18 1 1 1 3 5 1 7 1 2 3 4 5 6 1 1 2 1 2 5 6 1 1 10 101 1 2 1 1 1 4 144 1 2 1 2 3 6 1 2 3 10 1 1 1 14 1 1 2 1 2 1 1 3 4 1 1 12 1 1 1 2 3 1 1 20 1 2 1 2 1 2 5 8 43 1 2 46 1 1 2 3 1 2 1 2 8 1 10 1 2 1 1 5 1 2 1 4 21 1 1 1 3 4 1 2 8 1 2 1 2 5 1 1 1 4 1 1 3 13 1 1 1 2 18 1 1 96 1 98 1 1 3 1 2 1 4 8 1 2 11 1 1 3 1 5 1 2 1 9 1 2 23 1 2 1 4 1 6 1 2 1 1 2 1 5 37 1 2 3 4 1 2 7 8 1 2 1 2 1 2 1 1 3 1 11 1 21 1 23 1 1 1 2 1 4 1 8 1 2 3 1 2 6 1 2 1 2 1 4 1 8 1 1 3 18 1 1 1 22 1 1 3 4 5 6 97 1 1 100 1 1 1 3 1 2 3 1 2 1 4 1 2 7 11 1 2 3 1 1 363 1 1 2 1 1 6 1 8 1 2 1 …

Example 2:

Input: 934 675803680 53830657 947394095 163947441 842070220 917821744 739875294 48853692 79437714 417777782 291866217 723342841 795852004 321696898 339493117 536486509 470196114 203566380 136792999 633802718 457400117 812893497 413355165 556661996 772874686 895155639 209436848 62009663 320412858 625463659 822211377 566536060 679355257 107226664 332767366 611956015 470390343 434640029 846959527 723523596 62261813 499402034 661535074 284573330 942031224 812978523 546764862 942308242 259751463 646550342 25501830 869133177 648904994 816076920 985013214 714867638 605792420 939963197 297102053 543075900 165623698 728316034 570513780 989256115 333954401 318991127 869996627 469171898 813269728 908045571 393456350 753845539 56888285 557678674 269270376 145163439 380027465 305257396 895354499 903934807 541…
Output: 1 1 3 1 2 3 1 1 2 3 1 5 7 1 2 3 1 1 1 7 1 16 1 2 3 20 1 1 3 4 5 1 2 1 2 3 1 1 13 1 1 2 3 1 42 1 1 45 1 2 1 4 1 2 55 1 1 3 1 2 1 4 1 64 1 1 3 1 2 6 1 2 1 2 1 1 3 1 9 10 1 2 19 1 1 3 1 2 6 1 1 3 1 1 3 1 8 1 2 17 1 2 1 4 5 1 2 3 1 10 11 1 2 1 2 1 1 1 8 37 1 1 2 3 5 1 2 3 1 2 1 2 50 1 1 3 4 5 1 1 1 3 5 1 2 82 1 1 2 1 1 2 3 1 1 1 4 1 10 1 12 1 99 1 2 1 1 2 3 1 5 6 1 1 3 1 12 13 1 2 1 1 1 1 5 8 1 2 1 2 26 1 1 2 3 5 1 1 199 1 2 1 2 1 6 1 1 9 1 2 1 1 1 1 4 1 2 3 4 1 6 12 1 2 1 2 5 1 19 1 1 2 4 1 2 1 2 9 1 2 3 1 2 1 1 8 1 1 3 12 1 1 3 1 1 3 28 1 1 2 4 1 1 3 1 1 2 11 1 2 3 4 1 2 3 4 1 1 2 1 9 10 15 1 1 2 1 5 1 1 2 4 5 1 7 1 1 15 1 2 3 1 1 3 1 1 6 1 1 42 1 1 3 4 1 2 1 1 3 1 2 1 2 114 1 2 1 2 1 6 1 1 2 1 5 1 2 14 1 1 3 1 1 2 135 1 1 3 1 1 143 1 2 1 2 1 2 1 6 1 1 3 1 1 3 1 8 1 1 3 1 1 6 7 1 9 178 1 2 3…

Example 3:

Input: 2195 281329596 966982436 892366615 46908358 372264840 863956241 451442878 327458794 17738122 936816141 635646062 499678288 563011950 963799921 272704376 423334712 141945012 993801004 471153163 330276164 346822947 545083263 454525706 166191652 501200640 18881158 10165344 310280336 954134435 724205657 409345927 768874702 303854029 359643139 332204215 266455474 613311258 743241441 959183845 64565207 154212552 678149859 106366826 351051269 560200417 678343714 700796823 744796159 790909336 466381094 218599273 233362038 122531778 257436014 67003651 933339583 40203741 654098350 655565573 853061718 910988679 771841255 215179483 918149674 23278177 979672940 934427645 787981427 94444980 242722446 121077814 723646449 249971043 830103766 351672294 70138454 770502299 272833710 38908092 160462544 325347…
Output: 1 2 1 1 2 3 1 1 1 8 1 1 2 12 1 2 1 18 1 1 2 4 1 1 3 1 1 3 11 1 1 3 1 2 1 1 5 6 21 1 2 3 1 2 3 7 8 9 10 1 1 2 1 4 1 17 1 2 3 4 5 1 1 8 1 48 1 1 1 2 1 4 1 7 1 1 3 1 1 2 4 16 1 2 1 20 1 2 1 24 1 2 1 2 1 6 1 1 2 4 5 6 1 1 1 4 1 90 1 1 3 1 2 3 1 8 9 1 1 102 1 2 1 2 1 1 3 4 1 8 1 2 3 1 15 118 1 1 1 3 5 6 7 8 1 2 11 1 2 3 1 2 1 4 1 1 3 4 1 1 7 12 163 1 1 1 4 1 2 3 1 2 3 1 5 1 7 1 1 2 14 1 2 3 1 1 2 1 5 1 7 1 2 3 1 15 1 2 1 1 1 3 5 1 2 8 1 2 1 4 44 1 46 1 1 3 1 2 1 1 5 9 1 2 1 1 3 4 7 1 1 1 1 4 1 1 3 4 10 1 1 1 80 1 2 1 1 5 1 1 1 1 2 3 1 93 1 1 2 1 5 6 1 1 2 1 2 3 1 1 9 10 1 1 1 3 5 1 2 1 4 1 2 3 1 5 1 2 3 13 1 1 1 3 4 1 1 2 27 1 1 2 1 5 1 7 1 2 1 1 5 1 1 3 9 1 1 3 13 1 2 3 1 5 1 7 1 1 3 1 5 13 1 1 29 1 1 3 1 1 3 1 1 3 4 1 1 49 1 2 1 2 3 1 5 8 1 1 11 1 2 3 1 2 1 203 1 2 1 4 1 1 2 1 212 1 2 1 2 1 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Lunar ledgers Streak Back - MEDIUM Coding Problem | CodeTikki