CT56256

The Dusky ledgers of Ivo

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

In the lantern lake of Firefly Mere, Ivo the accountant keeps careful count of the ledgers. Recover the missing manifest, every figure matters. 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: 972 960518983 310881013 159225158 125206461 442463864 771149675 998533740 52415044 867642215 304771731 599692961 479050946 170141989 55285810 121357724 488874314 989989726 411124261 807156759 71748581 372365830 489645544 486485427 240421024 963451 873487195 623564528 497337122 98935608 293354800 126189481 927106710 546288597 805512123 719126215 721596988 779405079 380084820 795099704 291979543 759495592 915533604 94353096 60990498 178550907 8162564 430229701 350276282 54857090 411244274 155155053 45497453 841441940 524402673 873396012 815734609 699284118 592508870 565007085 45744022 667958960 229287438 267170546 530753379 187460835 632700074 197693606 652812224 972946437 539410508 37675417 376716399 286020006 905350635 113865986 638554617 638436585 145438507 468754744 959000879 846508371 4…
Output: 1 1 1 1 4 5 7 1 2 1 2 1 1 1 2 5 10 1 2 1 2 3 1 1 1 9 1 1 1 2 1 15 1 2 1 2 3 1 5 1 2 10 1 1 3 1 5 1 1 3 1 1 11 1 13 1 1 1 1 1 4 1 2 3 1 5 1 7 52 1 1 2 1 5 1 2 1 1 2 11 1 1 2 1 2 17 1 2 3 4 1 1 1 4 1 2 1 2 1 6 7 1 2 14 15 1 1 1 1 2 5 1 1 1 2 1 11 13 1 2 16 1 18 1 35 1 1 3 1 113 1 2 3 1 1 2 1 5 6 7 1 1 2 14 15 1 1 2 4 1 6 1 8 1 2 1 27 1 1 2 4 1 2 1 8 1 1 1 2 4 6 7 1 17 1 1 3 1 1 3 24 1 1 3 1 1 6 58 1 2 1 2 3 6 1 1 1 3 1 2 194 1 1 3 4 1 2 1 4 5 1 1 3 1 1 3 7 1 18 1 1 2 1 1 3 1 1 2 1 5 12 1 2 1 1 3 1 7 8 240 1 2 1 1 2 1 4 5 1 1 2 3 1 5 6 8 15 1 2 1 2 3 1 24 1 2 1 1 1 2 1 2 1 1 1 12 1 2 3 1 1 3 19 1 2 1 23 24 1 26 1 2 1 4 5 56 1 2 1 4 1 1 1 4 5 1 1 2 1 10 1 1 1 1 5 1 21 1 1 1 2 4 6 1 29 1 2 3 4 1 1 2 1 9 10 1 2 1 2 44 1 2 1 2 1 1 2 4 1 2 3 1 2 1 2 12 1 2 1 1 2 122 1 2 3 1 1 1 129 1 2 132 1 1 1 4…

Example 2:

Input: 641 930111001 898187310 215531770 636710398 278650072 70236658 714986395 22561369 23393155 342137764 690001708 707654805 94184088 640518912 66695468 525314252 726360445 747716331 974558859 361655834 429286737 126173656 922509247 10236113 294475807 736369747 297834111 849082606 994803443 661633134 968906204 376834527 992069400 239369309 948289329 63954653 13369671 723347464 411566970 569952500 317173980 846901896 913377248 875966868 389670268 902951866 87680880 537121138 287455429 770856978 134833621 551019720 649814569 647086431 528119100 723152064 661370860 650811319 976314100 780673310 806770180 916649862 785562587 682242288 601390523 973705162 418670829 669095702 355884066 367476078 799287942 279874247 262940603 668098437 234666484 152465544 70810179 254211613 451976431 545965974 218630…
Output: 1 1 1 2 1 1 5 1 2 3 4 5 1 2 1 2 15 16 19 1 2 1 4 1 2 3 1 5 29 1 2 1 4 1 2 1 1 3 1 2 1 7 8 1 1 3 1 2 1 4 1 2 3 1 1 6 1 1 26 1 2 3 1 1 1 7 1 2 1 2 5 1 1 3 1 1 1 4 5 6 1 11 1 1 1 1 1 4 5 1 8 1 1 2 1 30 1 1 3 34 1 1 1 1 5 6 7 1 2 10 1 1 2 1 4 1 1 18 1 1 3 1 2 58 1 2 1 4 5 1 1 1 9 1 2 1 4 14 1 74 1 2 1 1 5 1 1 1 9 1 2 3 1 14 1 16 1 1 2 1 2 129 134 1 1 2 3 1 1 7 1 1 2 4 1 1 3 1 1 3 1 5 1 1 22 1 2 1 4 1 1 3 1 5 1 1 12 1 2 37 1 2 1 4 42 1 2 1 1 5 6 1 1 3 1 2 1 4 1 15 221 1 1 1 2 3 5 1 2 9 1 1 3 4 1 6 1 2 1 4 1 1 1 2 1 10 1 2 1 1 5 1 2 3 1 1 3 1 8 1 1 11 1 18 1 1 3 1 1 1 3 1 5 1 2 1 9 1 1 3 1 36 37 1 1 3 1 2 1 2 3 1 7 1 1 1 2 5 1 2 15 1 1 2 1 2 5 1 8 1 1 26 1 1 2 33 1 2 1 1 1 4 102 1 1 3 1 1 1 2 3 1 7 1 1 2 1 5 1 7 1 1 3 1 1 2 3 5 9 1 1 2 4 5 1 2 31 1 1 1 3 1 5 7 1 2 44 1 2 1 2 3 1 5 1 9 1 2 1 2 1 …

Example 3:

Input: 1052 782840855 340578203 275811578 313630556 703331528 694506707 763090195 892116327 626549587 300361652 401620057 457368264 528028013 777519513 96195269 655756112 984447553 436518562 116545192 348323442 239879188 252946783 405880169 441851786 242735089 282983928 728837898 651120165 356750856 826514006 830592311 757718598 702437468 39368614 823038365 644717 227951237 264725972 785690951 580485337 700430503 816532073 554795257 682642338 906445947 488477194 685706232 923350022 817641445 206793893 512945370 615408407 938520761 202023367 420098601 250766133 707647487 738536784 79350062 207871268 371347741 654342062 350380262 575090139 918571857 487294946 393152445 572229408 127063369 438184984 447490270 313688809 71882713 140057056 810854165 329695382 57669411 495801998 810841108 876531405 165…
Output: 1 1 1 2 4 1 6 8 1 1 2 3 4 6 1 2 17 1 1 2 1 2 5 7 1 2 10 1 1 13 14 1 1 1 4 1 2 3 4 1 2 7 1 2 28 1 2 31 1 1 2 3 36 1 2 1 4 5 1 2 3 4 1 2 12 1 1 3 1 2 3 1 1 2 10 1 1 3 4 15 1 2 1 19 1 2 3 71 1 2 3 1 1 2 3 8 1 2 1 2 13 1 1 1 3 106 1 1 3 1 5 1 1 1 3 4 5 1 1 8 1 1 3 1 5 20 1 2 3 4 1 1 2 3 1 6 1 8 1 1 15 1 37 1 1 2 3 5 1 2 1 2 1 1 2 4 7 15 1 1 2 1 2 1 2 7 8 1 1 1 2 4 15 16 1 2 1 4 1 2 7 8 1 10 1 2 1 2 5 1 1 2 87 1 1 3 4 1 2 1 1 1 3 7 12 1 1 3 1 1 1 1 5 1 1 3 1 218 1 1 3 1 2 1 7 1 2 1 2 5 6 7 15 1 2 1 1 2 6 1 2 1 1 1 6 1 8 1 2 3 4 5 6 1 16 38 1 2 3 4 1 6 1 8 1 1 1 2 3 1 15 1 2 1 4 1 2 22 1 1 3 1 5 1 1 1 3 5 1 2 1 1 1 4 1 8 41 1 2 3 1 2 1 2 3 6 1 52 1 1 1 2 1 5 1 2 8 1 1 3 1 5 1 15 1 1 1 1 1 4 1 7 8 1 1 1 4 14 15 1 1 3 4 1 2 7 8 1 2 3 1 2 1 1 2 6 1 2 1 36 1 1 1 1 1 6 1 1 3 4 1 2 7 1 1 3 121 1 1 3 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Dusky ledgers of Ivo - MEDIUM Coding Problem | CodeTikki