CT45953

Shepherd's Streak Back Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the ferry landing of Crosswater pays by the answer, and Shepherd intends to earn it. First: the full register of registers. 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: 1372 43216875 973441520 456329340 522542147 305776619 393056402 566933326 85229781 985402158 487110541 977808340 604506015 476258603 416956811 691832226 781627258 84643424 714446816 393808902 781423822 138311863 392609884 217970480 241167312 226757721 749316274 635980959 537488542 714888936 57359175 76291784 672291816 797500918 611577909 10438824 789503591 303619325 237178088 954789428 837055577 236261178 401577165 339374226 110112577 130953835 606068293 124013652 233035716 477961193 156465466 235933158 851251908 282751263 770340540 515146085 450202245 613612810 179239966 781872355 493661264 548287709 922471457 295180229 613068451 873905429 492957872 696413028 342902781 101988416 590623593 780587099 473996004 205622411 624751714 603735768 786807628 587810861 677115373 10969454 647779179 53…
Output: 1 2 1 2 1 2 5 1 9 1 2 1 1 1 4 5 1 2 1 4 1 2 1 2 1 6 1 1 3 1 2 3 22 1 1 3 1 1 28 1 1 2 1 1 2 6 1 2 3 1 2 13 1 2 1 1 3 1 7 1 2 23 1 2 3 1 2 1 1 3 6 1 1 3 1 11 1 2 1 2 1 6 21 1 1 3 1 5 1 2 1 1 2 6 1 87 1 2 1 2 1 4 1 1 7 106 1 1 1 2 1 6 1 1 2 3 11 1 2 1 1 5 1 1 2 3 1 6 1 2 9 1 1 1 2 5 1 1 8 1 2 25 1 1 1 3 1 1 2 4 1 2 1 2 1 14 1 1 3 1 2 3 1 2 1 1 3 6 1 2 3 1 2 1 1 1 60 1 1 1 1 3 6 7 1 1 1 188 1 2 3 1 1 1 1 1 3 1 5 1 2 3 9 16 1 1 1 1 21 1 1 2 1 1 5 1 2 1 2 10 1 2 1 2 15 17 1 1 1 1 1 3 7 1 1 10 1 1 1 2 1 2 3 1 7 1 10 1 2 1 4 5 1 7 1 1 21 1 1 3 1 5 1 7 1 2 3 4 1 1 62 1 64 1 2 3 4 5 1 7 1 1 1 11 12 13 1 2 3 4 1 2 84 1 1 2 4 1 2 1 4 1 1 1 1 13 1 1 2 1 1 19 1 1 3 4 1 2 1 2 1 1 3 1 9 14 1 1 1 3 1 2 7 41 1 1 1 1 5 1 2 3 4 1 1 3 8 1 1 3 1 59 1 1 3 1 2 1 7 1 2 1 2 1 1 5 1 2 1 18 1 2 3 1 2 1 1 1 3 1 5 9 1…

Example 2:

Input: 187 683289758 767312644 579019327 778045096 487380123 358333852 793369156 577224734 734648611 5222661 750446365 359191291 469233880 244185482 943671825 140425722 459386353 481389655 188027191 211051790 725779572 135712326 332293051 763861300 217765719 859280569 378646182 457685748 893454269 674347941 966565282 46793928 736376778 496570723 658565829 69195702 760203051 740843536 775934498 561277180 630261857 292173315 205377626 914537645 40636683 397693378 468699462 608597984 101081990 676523743 439077565 23189671 635256619 145404795 275804415 820643668 281300941 475633032 685182083 912718482 251758595 135421347 301652331 821389601 424364617 605661754 81043407 718930355 104603705 501097575 847477654 198692095 366125593 91743628 858105986 53399102 31851474 118557686 253812840 336598985 931332…
Output: 1 2 1 4 1 1 7 1 2 1 4 1 2 1 15 1 2 3 1 2 6 1 2 9 1 11 1 2 14 1 31 1 2 1 2 1 6 1 8 1 2 1 1 13 1 2 3 4 1 6 1 1 3 1 2 12 1 2 3 16 1 1 3 4 1 2 1 4 1 2 11 1 2 1 15 1 1 3 4 5 50 1 2 1 4 5 1 2 3 1 2 3 1 8 1 10 1 2 1 1 2 21 1 104 1 1 2 3 4 1 2 1 4 1 1 3 8 1 15 1 2 3 1 5 1 7 1 2 1 4 1 6 7 1 1 3 11 1 2 1 2 5 24 1 1 3 1 1 6 1 1 2 1 2 1 1 7 1 1 11 1 1 2 1 1 2 1 19 1 2 1 2 1 2 1 4 5 1 2 3 1 1 2 1 15 1 1

Example 3:

Input: 1097 875044443 106720829 636580582 551216363 902656230 379680893 506793625 111315783 157088758 213610850 882446533 724476966 117201889 705205989 407141733 809455790 754569180 713785023 801826751 510591710 466388333 39066819 880875512 937683074 373150445 189159437 362164226 422288011 883238375 19223368 8548648 421016812 973453312 406958435 176469362 128366772 472739028 629505770 412618199 890176245 134571510 713393585 908624177 373220402 928682926 184576477 996579131 557131732 575742473 81551514 569844891 643731914 712655776 853488938 913899671 963003626 560572243 889867140 978299839 86233014 489804811 279032402 853428231 590968588 739447476 924911717 69944850 889345374 25114545 972494471 696915192 474534145 965667491 31202580 693858576 445390746 969442593 962886393 326568490 599295264 8881…
Output: 1 1 2 1 5 1 2 1 2 3 6 1 1 2 1 5 1 1 3 1 1 1 12 24 1 1 2 4 5 1 1 3 33 1 1 1 4 5 1 7 1 2 10 1 12 1 47 1 2 1 2 5 6 7 8 9 1 2 12 1 2 1 4 1 2 7 1 2 1 11 1 1 3 1 2 1 7 1 1 2 3 1 1 1 3 1 1 6 42 1 2 1 4 1 6 1 1 1 1 11 1 1 1 1 1 4 1 8 1 2 3 4 1 14 1 2 3 4 19 1 2 3 34 1 2 3 4 1 1 2 1 1 44 1 1 3 1 1 3 1 52 1 1 2 1 5 6 7 1 2 3 11 1 1 3 1 1 1 4 1 2 3 8 12 1 2 1 1 5 1 124 1 1 2 3 1 5 7 1 2 1 1 5 1 14 1 2 1 2 3 4 21 1 1 1 25 1 2 1 4 1 155 1 2 1 4 1 2 1 2 3 1 11 12 1 2 1 2 3 1 1 175 1 2 1 4 1 2 1 4 1 2 1 1 2 1 5 1 2 1 15 1 2 1 1 2 6 1 1 1 29 1 2 1 1 5 1 7 1 1 3 4 1 1 1 44 1 2 3 1 5 6 1 8 1 1 3 1 2 1 1 3 1 7 11 1 13 1 2 1 2 3 1 1 6 30 1 2 3 300 1 1 2 3 5 1 2 1 2 1 4 1 13 1 2 1 2 1 6 1 1 3 1 5 1 2 1 9 1 2 3 1 1 2 1 2 18 25 1 2 3 1 1 3 1 5 6 1 2 1 1 3 1 1 8 1 2 1 2 1 6 1 2 1 1 2 3 5 22 1 2 1 35 1 2 1 1 2 3 5…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Shepherd's Streak Back Ledger - MEDIUM Coding Problem | CodeTikki