CT49026

Lysander's marks Reckoning

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the port of Emberfall as Lysander unrolls the day's manifest of marks. 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: 3194 770866137 165553605 179318668 559566956 502198743 702479595 855185287 471626933 16149945 122309545 112145494 37053499 803924213 293034194 200432794 664306102 826296383 285944413 567680313 493475143 84563630 701569128 670178308 383974904 53395353 170278395 217762983 813812122 779751235 123644028 774702326 451127657 77393581 347347630 498126541 208068118 252238824 56906485 790428265 562781209 397341065 861970765 213769886 942876509 966454589 655062873 190616619 955040310 658042965 228119873 160466493 585558654 928852284 814586840 530703846 226811609 448792522 104107874 331432093 444196684 593981278 68811498 658800940 380284221 110751228 488379751 992029685 753102246 288472674 407630311 357175931 650086202 29548755 179861747 550689809 938896482 447002276 349467523 639432689 420874580 399…
Output: 1 1 2 3 1 5 7 1 1 2 1 1 6 1 1 3 10 1 2 1 1 5 1 1 1 2 3 11 1 1 2 1 1 2 4 1 2 1 11 1 1 42 1 44 45 1 1 3 1 1 1 3 5 1 1 1 2 1 2 3 7 1 9 1 1 3 67 1 1 2 1 4 1 2 3 9 1 1 3 1 1 1 1 4 1 2 11 1 13 1 15 1 1 1 4 1 2 7 1 2 3 1 12 1 1 15 1 1 2 1 2 1 1 8 1 2 41 42 1 2 54 1 1 1 3 4 6 1 2 3 1 5 6 13 14 1 1 1 3 73 1 1 3 1 1 3 1 5 1 1 11 1 1 2 15 16 1 2 1 1 1 162 1 1 2 1 2 1 2 3 1 5 1 2 1 1 1 13 1 1 2 1 4 1 1 1 2 9 1 2 3 1 15 1 1 3 1 2 3 1 2 9 1 1 2 4 5 1 2 1 1 1 2 1 8 1 2 1 17 1 28 1 1 3 1 1 1 2 4 5 6 1 1 2 4 12 1 1 2 4 1 2 78 1 2 1 4 1 86 1 1 1 1 4 1 6 1 1 1 1 1 4 1 7 8 1 1 11 1 1 3 23 1 2 26 1 1 3 1 31 1 2 1 2 3 1 124 1 2 3 1 1 3 1 1 1 4 1 9 1 2 1 4 5 1 1 3 4 1 2 3 1 151 1 2 3 1 1 2 1 1 6 1 2 1 4 1 1 3 1 2 10 1 2 1 4 15 25 1 2 1 4 1 1 2 1 5 6 11 1 2 1 1 5 1 2 3 1 1 6 1 2 3 1 2 12 54 1 2 3 1 2 1 4 5 1 10 1…

Example 2:

Input: 1967 649502847 857460222 928342429 672445668 26681343 464057590 467720876 958240269 955176673 439770240 941649790 445186873 391499344 301904725 769365623 740705874 398037804 343000450 545914101 434362323 321415888 932657461 143288387 483889125 219692507 459529109 815755578 60118917 600196038 610830284 703566396 580492438 282307963 561210501 662778911 640527830 787466850 457133538 339686175 236488666 678668934 647213051 522950668 670935232 727565766 397366298 813807127 684107190 731029319 47257229 315082034 384000846 84734370 198577293 162253301 105898099 683624956 342390009 928751085 193365524 111805091 787640793 532884613 667885852 861979198 12110432 997419711 486093569 705349965 81384105 44725887 881422758 796192494 837911217 136716899 963868877 839390548 793295832 949699058 590723286 91…
Output: 1 2 3 1 1 2 3 8 1 1 2 1 1 1 4 1 1 1 3 1 1 11 1 2 1 2 5 1 2 3 4 1 1 2 4 1 10 1 1 1 4 1 1 3 8 1 20 1 2 1 2 3 1 2 1 1 8 1 37 1 1 3 1 2 6 1 67 1 2 1 1 5 1 2 1 9 1 1 3 1 2 1 1 1 6 1 2 1 4 1 24 1 2 1 1 5 1 1 3 9 1 1 3 1 1 3 1 2 1 2 20 1 46 1 1 1 4 5 1 1 3 4 1 11 1 2 3 1 1 3 4 1 1 3 1 1 1 14 1 2 3 1 1 3 1 5 1 1 1 3 1 1 15 1 2 1 1 2 4 1 2 1 8 1 1 2 1 5 1 17 1 1 3 61 1 1 3 4 1 1 2 1 4 1 7 1 1 3 1 5 1 2 1 1 5 11 1 2 1 2 3 4 5 1 1 10 1 12 1 1 1 27 35 1 1 3 4 1 1 1 4 1 45 1 1 2 1 4 5 1 1 8 1 1 2 13 1 1 2 4 1 6 1 21 1 2 1 1 3 27 1 1 1 1 4 5 6 1 1 3 38 1 1 2 198 1 1 1 1 3 1 6 1 2 1 10 1 1 2 1 2 1 4 1 1 2 1 2 10 1 2 3 16 28 1 2 1 2 1 2 1 4 5 8 1 12 1 2 1 1 1 2 4 1 2 10 1 2 1 14 1 2 1 4 1 2 1 2 3 1 1 2 27 1 1 269 1 1 3 1 5 1 1 2 1 1 1 4 1 1 3 1 2 6 1 15 1 2 1 1 5 1 2 8 1 2 3 32 1 1 1 4 1 2 1 1 2 1 11 1 2 …

Example 3:

Input: 442 959841492 789244353 757595014 719922891 566041347 382442140 739035779 6580943 279582097 343340560 143110789 429971041 402559796 748215672 311944933 487471096 710202988 573919176 417787775 680395696 179562430 23124117 947562133 801536293 798393148 357031607 466210662 727945475 940395073 157460738 599110078 615514011 722183665 930436059 990665268 821179568 125133712 696701626 489164126 860245220 913646838 348607757 363737482 390651824 702498202 452817648 10380776 614102635 899957084 236997355 989301106 814012267 6559325 143419814 789840344 715410317 694279642 795862247 194964704 230612257 669608099 151882561 707294851 720174862 471031055 80707386 200695599 754825727 419551295 607832323 70390356 807842117 908878573 621815831 536475454 707796422 718395905 77361138 523443750 327090167 86049…
Output: 1 1 1 1 1 1 4 1 2 3 1 5 1 11 1 2 3 1 1 3 1 1 22 1 1 1 2 3 6 1 2 3 4 5 35 1 1 2 1 5 6 1 2 3 4 1 1 3 8 1 16 1 1 2 3 1 1 6 1 2 3 1 5 6 1 1 2 10 1 2 1 20 22 1 1 3 4 1 2 1 8 1 2 3 1 1 1 3 5 17 40 1 1 3 1 1 2 1 5 1 2 1 4 1 1 12 1 2 1 1 2 4 1 1 3 4 1 2 68 1 2 1 1 1 4 1 6 9 1 2 3 1 5 1 1 8 1 1 11 1 2 1 4 1 1 3 1 2 1 7 32 1 1 1 2 4 1 2 3 4 1 11 1 1 114 1 2 1 2 3 1 1 6 1 2 3 1 1 2 1 1 6 1 1 2 4 1 1 13 1 2 1 1 18 1 1 3 1 32 1 1 2 152 1 2 1 2 1 6 1 8 1 2 1 1 5 1 2 1 2 1 4 5 1 7 8 1 1 1 1 5 14 1 2 3 1 1 3 1 2 1 10 1 2 13 1 2 1 1 2 4 1 35 1 1 3 1 2 3 1 2 1 4 1 12 13 1 1 58 1 1 2 1 5 1 7 1 2 3 1 78 282 1 2 1 4 1 2 1 8 1 2 1 2 3 4 1 2 3 1 11 20 1 2 1 1 3 1 5 1 7 1 9 1 1 3 1 1 1 4 5 6 21 1 325 1 2 3 1 2 3 1 5 1 10 1 2 1 1 1 6 1 1 2 1 2 12 1 2 1 4 1 2 1 4 1 1 1 4 5 10 1 1 1 4 5 1 1 1 4 1 6 1 1 3 1 42 1 1 1 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Lysander's marks Reckoning - MEDIUM Coding Problem | CodeTikki