CT44807

The ledgers at Silverfin

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Nico inherited the apothecary at the herring shoals of Silverfin along with its curious bookkeeping system for ledgers. Time to make sense of it. 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: 3680 224611194 166138940 932769 324457114 49279602 804874064 669406727 172078469 51502144 239428051 870732822 88051143 305337647 554838166 800853492 941670746 299909893 40060597 665391067 483163541 638704202 872522811 281051031 841692398 887286143 24004386 119520202 980597479 371170707 720386536 575479473 348658630 530902398 192822368 461365593 944699741 282334859 101872010 892295745 555271806 368154289 514375221 690055978 749579725 395979457 12172577 973799830 781821428 649898261 763365453 292982922 920772817 145322557 795523824 733747963 787286379 448210697 27737809 183525051 644254705 415022949 424162215 835077570 608704032 561915258 737219554 582973656 35758880 272199271 610415450 641711468 183685662 420813542 508221677 7977495 884316439 873806605 277590541 862774458 138023509 71919524…
Output: 1 1 1 4 1 6 1 1 1 3 11 1 2 3 4 16 1 1 3 1 2 6 1 2 9 1 2 28 1 2 1 1 2 1 2 8 1 1 3 1 1 2 4 5 1 1 19 1 1 2 1 5 1 2 1 2 1 1 2 4 1 2 11 1 1 3 1 1 2 4 5 1 2 3 1 24 1 1 2 1 2 1 4 1 1 7 1 2 1 4 1 1 14 1 1 3 18 1 2 1 1 5 1 2 3 1 60 1 2 1 2 1 1 3 4 7 1 1 2 4 1 15 1 1 2 4 1 1 3 1 9 1 133 1 1 3 4 1 2 1 2 3 1 1 3 7 8 1 12 13 1 19 1 2 1 4 1 1 1 4 9 1 2 1 1 1 1 2 1 6 8 39 1 1 42 1 2 45 1 1 3 1 1 1 2 1 4 5 1 7 1 2 1 4 1 1 16 1 2 1 1 1 2 5 8 9 29 1 31 1 1 1 1 1 6 1 2 40 1 1 2 4 1 2 1 4 1 1 11 1 1 1 4 1 2 3 4 5 1 7 1 24 25 1 1 2 4 1 1 1 1 2 3 1 2 9 1 1 1 2 4 1 7 1 1 1 3 4 1 7 1 1 26 1 1 3 1 1 6 1 1 1 3 1 42 1 1 288 1 2 1 2 3 1 1 8 1 1 2 3 1 1 3 16 1 2 3 1 1 1 1 5 6 1 2 1 2 3 6 1 2 3 1 1 2 7 1 1 1 1 4 6 14 1 1 1 4 1 20 1 2 1 2 3 6 33 1 2 1 2 5 1 2 1 9 1 2 1 1 5 1 1 3 1 2 1 2 3 4 1 2 9 27 1 1 2 1 378 1 2 1 2 …

Example 2:

Input: 3970 15359645 298033015 428345834 832259937 14369673 214704520 793261057 334756978 352389873 481963750 267610723 796680207 314697692 196198224 902554099 621729990 260191456 215442208 88736781 439543440 165471538 313691764 858780599 597565066 375610228 891949301 635440431 216716279 647007624 132311405 918080029 904133740 300484639 111453113 80731983 839969645 697490360 729646680 84431485 437843591 241213378 417893267 750236698 328325679 803730141 91864190 609783868 904047281 982507963 107927965 751635605 887436593 316870547 738870291 827708610 731721177 700047804 450815729 17600692 297915631 148233930 263778241 507386506 548734075 39598949 641315347 911902590 689973630 600494245 699785928 57234481 664494951 690485646 525606279 28022126 535949549 489352394 230278232 178092616 761339108 81596…
Output: 1 2 3 4 1 2 3 1 2 3 1 8 1 1 15 1 1 1 1 4 1 2 8 1 1 11 1 1 3 1 31 1 1 1 1 4 1 2 1 2 1 2 7 1 9 1 2 16 49 1 2 3 1 2 3 1 1 1 1 2 1 2 6 7 1 9 18 1 1 3 1 2 3 1 1 3 1 1 1 13 14 1 16 1 85 1 2 1 4 1 2 3 1 9 1 2 3 13 1 1 1 1 3 1 5 7 8 1 11 1 2 27 1 1 1 4 5 1 2 3 1 1 11 39 1 2 3 4 1 6 1 8 1 2 3 1 1 3 1 2 1 2 3 6 1 1 3 1 11 1 13 1 18 1 1 1 72 1 2 1 1 5 1 1 3 4 1 6 1 1 3 4 1 1 2 176 1 2 3 1 2 1 4 5 6 1 1 1 3 1 6 1 8 1 2 1 4 5 1 7 1 2 3 1 2 1 4 1 2 3 1 2 10 14 22 1 2 1 4 1 6 43 1 45 1 2 1 2 1 2 3 4 5 1 1 3 13 59 1 2 1 2 1 2 3 1 2 10 1 1 2 1 1 3 1 1 19 1 1 2 4 1 2 1 2 1 10 30 1 2 1 4 1 1 3 1 5 10 1 1 3 14 1 2 1 2 5 1 2 1 9 1 2 1 27 1 1 2 4 1 2 1 2 1 1 2 6 1 1 2 1 2 5 1 1 1 3 5 1 2 8 21 1 1 3 1 2 1 2 1 2 1 4 35 1 2 3 43 1 1 1 4 1 1 1 4 5 53 1 2 3 4 5 1 1 3 1 2 1 2 8 1 10 1 12 18 1 1 1 3 5 1 2 1 2 3 1 1 84…

Example 3:

Input: 31 816652797 379948414 583613188 431025735 18285113 699670595 550716481 21432125 710361319 878531738 544614675 705908688 432154337 379134935 428310327 235667439 607545637 453506593 37979960 208668799 993483878 275700049 77208648 576327958 882321046 657369036 675344678 801307597 8945282 228937021 421080168
Output: 1 1 2 1 1 5 1 1 8 10 1 2 1 1 2 1 5 1 1 2 21 1 1 3 4 1 2 3 1 2 3

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The ledgers at Silverfin - MEDIUM Coding Problem | CodeTikki