CT44875

The Streak Back at Tranquil Basin

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the lotus ponds of Tranquil Basin as Cartwright 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: 1009 4005536 593951384 68913139 424066106 217739074 444657092 254220988 245504960 944508241 213202279 968662984 324543812 915013733 650533746 960428477 902446059 684650817 646539109 757339087 702859671 936237440 580340665 464189750 16561617 822731002 153296038 357476000 545155690 948020138 598388030 741545909 448648552 269146286 305128739 722610625 528385333 219479444 266628662 351325599 744642589 425011512 413238867 125328582 946224690 33136408 798244532 405814532 101031798 127745996 297365769 959535212 112553171 437689793 486199501 347842797 197013297 77405650 526388590 945011812 839617542 661540277 322718393 978751527 597766874 332287696 261460811 657146843 113230065 975755569 699634988 943219953 400071631 589381933 656385029 131251411 250630829 175860061 492999221 666887093 742447811 5…
Output: 1 2 1 2 1 4 1 1 9 1 11 1 2 1 4 1 1 1 3 1 6 1 1 1 4 1 2 3 14 1 2 1 1 2 4 1 1 2 3 11 1 1 1 15 1 2 1 1 2 3 36 1 2 3 1 1 1 7 8 1 1 1 63 1 1 1 4 1 6 1 2 1 2 3 1 2 1 4 8 9 1 1 2 1 4 1 7 17 1 1 22 1 2 1 2 1 1 7 1 1 3 1 5 1 7 8 1 10 1 1 3 1 1 2 24 1 1 1 3 120 1 1 3 1 5 1 2 8 9 1 2 1 1 2 1 4 8 1 1 2 4 1 23 1 1 2 4 5 1 2 3 1 2 1 12 1 1 3 1 2 6 1 2 44 45 1 1 1 3 1 5 6 1 9 1 2 3 13 14 1 1 3 1 2 1 2 3 6 1 2 9 1 2 1 2 3 4 5 1 2 1 1 2 4 1 1 1 3 1 1 11 1 13 1 1 1 2 1 2 1 4 1 10 1 1 2 4 1 64 1 2 1 2 5 6 1 237 1 2 3 4 1 1 2 8 1 2 1 12 1 1 3 1 1 2 4 1 2 7 1 1 2 1 4 1 6 7 1 2 1 2 1 4 37 1 2 3 4 5 1 2 1 4 10 1 12 1 2 1 2 5 6 1 57 1 2 1 4 1 1 3 4 66 1 1 3 1 2 1 1 3 4 7 1 9 1 2 1 2 1 2 1 1 1 1 2 3 9 1 2 1 1 30 1 1 1 1 3 1 1 2 1 9 1 108 1 1 2 4 1 2 3 1 5 1 1 3 4 1 1 1 13 14 1 2 21 1 2 3 4 1 1 3 1 1 3 4 1 1 1 2 1 …

Example 2:

Input: 1750 973740815 379301127 259378107 574012742 81312345 578146895 928396733 986233962 664390464 974855326 72105379 448980476 465155060 264286247 341682448 291313750 611875380 582610158 400853665 284557206 587247025 979894506 722190892 258533838 609204993 912297664 842580750 772166648 600932090 223912939 649230801 686475158 286729816 493995176 829714941 397129268 459631046 834015279 688873226 319426037 834156324 613318715 73440727 440408718 67274559 823959008 481784209 677939342 701420665 760706476 547374783 47550307 781098428 649329851 740865845 155075650 659315983 139209825 699367388 790389225 481266359 502458369 954481374 48648799 101258507 114252375 883860410 26905250 193881012 663295858 517452258 306649871 735436618 608915846 281130182 64083646 891361814 134184002 140050893 225338843 521…
Output: 1 1 1 3 1 5 6 8 1 2 1 2 3 1 2 1 7 1 1 1 4 14 1 1 2 4 1 1 1 1 3 4 1 2 8 1 2 11 1 1 14 1 1 2 1 5 1 2 3 4 1 1 7 1 2 1 2 1 4 14 1 2 41 1 2 3 4 1 2 3 1 1 6 1 1 1 14 1 2 3 4 1 1 7 85 1 1 2 1 1 2 7 1 1 3 1 1 2 3 1 1 3 4 5 1 1 12 16 1 1 3 4 28 1 1 2 3 1 34 1 2 3 1 2 3 1 1 3 7 1 1 2 48 1 2 1 4 1 1 1 4 1 2 1 12 1 2 1 1 2 1 2 68 1 2 1 2 5 1 2 3 1 2 3 1 1 3 1 5 9 1 11 1 13 1 2 1 2 3 4 1 2 3 8 1 1 13 1 1 2 1 2 1 1 1 4 1 8 11 1 1 1 45 1 1 3 1 1 1 4 8 1 55 1 2 1 2 3 61 1 1 3 4 1 6 1 1 2 1 1 6 1 2 3 10 1 12 1 2 1 2 89 1 1 2 93 1 1 1 3 1 1 3 8 1 2 3 1 2 1 1 5 1 1 2 9 21 1 1 1 3 1 27 1 2 3 1 1 6 1 2 3 4 1 2 3 1 9 43 1 2 3 1 5 1 1 1 4 1 6 1 2 1 10 1 12 1 2 1 225 1 1 2 1 1 2 1 1 1 9 10 1 2 3 1 15 1 2 3 1 5 6 1 1 3 1 5 12 1 1 15 1 1 2 3 1 36 1 2 1 2 5 1 1 2 1 1 2 1 2 8 10 1 2 1 2 1 16 1 2 1 25 1 1 2 4 1 2 1 4 …

Example 3:

Input: 2873 500502617 765480074 318602728 274090118 613470143 870184101 475835995 171533985 866830104 757224335 670212580 979443093 692313503 382988621 398195170 831760521 960681285 390755777 13782791 688996900 303344422 173838415 80097002 986977539 405575946 827844910 825491677 23070442 353062118 507518 730838942 659289893 836474427 635834060 906146967 554258971 634409778 529823286 533367788 364265602 55564408 867639229 437825052 733560408 194460476 649831081 180853109 852959869 513963595 986431248 907471185 829315255 273575812 828097436 156593084 168504827 326643568 863501622 858253301 1574290 958910826 978761308 555534194 696458550 105209187 305695813 463222522 612719224 346665931 773205768 914022240 796147878 325038030 567540582 655042349 263814813 436690434 889937317 509893374 719136295 9072…
Output: 1 2 1 1 3 6 1 1 3 1 1 12 1 1 2 4 5 1 1 3 1 1 1 24 1 2 1 1 2 1 4 1 9 1 11 1 2 1 2 1 1 7 1 2 1 2 1 6 1 26 1 1 1 2 1 2 3 7 1 1 11 12 1 2 1 2 3 4 1 8 9 1 1 2 3 1 2 7 1 2 10 1 1 3 1 2 1 7 89 1 2 3 4 1 2 1 4 5 6 1 12 1 1 3 4 1 2 1 1 1 3 5 1 7 1 15 1 2 1 1 1 1 4 1 6 1 11 1 1 2 1 5 1 2 1 2 1 6 1 1 1 3 1 17 1 1 3 1 1 2 3 1 1 1 2 3 10 1 58 1 1 2 4 1 2 1 4 1 1 2 12 83 1 1 2 1 4 1 1 2 1 1 2 1 2 6 1 1 1 2 4 12 1 1 3 19 1 1 1 1 4 1 2 1 1 1 2 1 5 7 10 1 124 1 2 1 2 5 6 7 1 2 1 1 3 1 2 3 4 1 11 19 1 2 1 1 1 3 1 1 2 3 4 12 1 2 1 2 1 18 1 1 3 1 1 167 1 1 3 1 1 3 1 1 1 2 4 1 1 7 1 2 3 1 1 3 7 1 1 2 19 26 1 1 3 1 1 2 4 1 1 7 1 1 10 11 1 1 3 1 1 3 1 2 9 1 1 3 1 5 1 1 1 1 5 6 1 2 3 1 2 3 38 1 2 1 1 2 1 4 1 6 1 2 3 1 2 1 2 8 1 10 11 1 20 1 1 2 4 1 2 3 1 2 3 1 1 73 1 1 2 1 4 108 1 2 1 1 5 1 2 1 9 1 2 1 2 1 4 1 1 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Streak Back at Tranquil Basin - MEDIUM Coding Problem | CodeTikki