CT40410

Piper and the Wild ledgers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

It is audit day at the cliffside roost of Stormrest. Piper spreads the ledgers records across the table and picks up a sharp pencil. 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: 1342 928954339 791496788 889971459 430251102 631733795 833644469 602371962 548808993 214873916 633153722 135878265 742894927 900550724 488672824 814596804 231060807 585849694 665821476 719906001 197843002 876973425 76264784 537463410 579965006 270531152 645653934 770762758 115674348 403504182 305282075 827353650 633350470 117881170 29995437 621286871 740637740 900031823 238066289 210076335 828972713 857561416 819346783 71693439 741387134 823994927 37503951 270635392 537633724 6180866 289144269 270488806 734813 244128971 508500981 624158911 892199785 632028055 185699220 18915692 66678977 475943489 928903728 813705062 416694212 182373735 57943379 186330953 982541769 459324564 733390849 231363590 808836398 787270232 136238975 412148298 126845954 347370055 76257995 934357653 274694600 38905698…
Output: 1 1 2 1 2 3 1 1 1 4 1 6 12 1 2 1 2 3 4 1 8 1 2 3 1 5 6 1 2 1 10 1 1 1 3 5 24 1 1 3 4 1 1 2 4 1 2 3 1 2 1 1 2 6 10 19 1 1 1 2 4 61 1 1 1 1 3 68 1 2 1 4 1 1 2 1 2 1 11 1 2 1 4 1 1 7 8 1 2 1 1 1 14 1 2 3 1 2 1 4 1 1 2 3 12 1 2 1 1 3 1 1 1 4 1 2 1 2 5 6 53 1 1 1 3 1 6 1 1 1 131 1 1 1 1 1 3 1 2 3 4 10 1 2 1 2 3 1 2 1 1 1 2 7 1 1 1 2 1 2 6 8 1 2 18 19 1 1 2 28 1 41 1 1 3 1 46 1 2 1 1 3 1 1 2 3 10 1 189 1 1 2 3 5 1 2 8 1 2 3 4 1 2 1 2 3 6 1 1 3 1 1 2 25 1 2 3 1 5 1 1 2 3 1 1 2 1 8 15 1 2 3 1 2 1 2 5 49 1 51 1 2 1 1 3 1 5 1 1 2 1 4 1 1 2 14 17 1 2 20 1 2 3 1 5 1 2 8 1 1 2 4 1 1 3 1 5 1 11 1 1 2 1 2 3 7 1 1 1 30 1 1 1 3 1 2 6 8 1 2 1 2 1 14 1 1 1 2 1 4 1 312 1 1 3 1 1 1 3 1 2 6 1 2 1 1 3 1 2 1 9 1 1 19 1 1 3 1 1 3 1 1 2 3 8 1 1 11 1 1 3 1 16 42 1 2 1 1 1 4 1 6 1 1 2 1 4 1 1 3 4 5 10 12 1 14 1 2 25 …

Example 2:

Input: 2844 602268234 958054958 950255249 769556487 464646534 821187764 597693689 570245223 794506909 443415698 241166962 22716737 68939397 113969856 521820467 544333503 60207881 473442721 104407537 57485146 113157367 907998489 332842695 928978000 610606562 852278646 41018841 365962023 255467504 884231655 326711204 827256611 809598598 895058055 719540219 403453582 78178423 178134961 389074045 140072878 747475828 202877827 621155671 54925243 127174866 423082569 265629354 122203009 269789923 468715168 697621546 673611299 8183273 724802807 817994182 557300527 436899596 111085305 198802198 476168523 429390573 982643006 583583964 872704243 470548717 510183003 431979712 59599130 831851333 472341826 198881250 998273877 586810917 566402748 259633579 159623539 437745219 811441946 405813310 17082304 689453…
Output: 1 2 1 1 1 3 1 1 3 1 1 1 2 3 6 7 1 2 1 1 3 19 1 21 1 2 1 2 1 6 1 2 1 10 1 1 1 2 3 1 7 1 2 1 2 3 1 1 3 7 10 1 1 13 21 1 1 1 2 4 1 62 1 2 1 2 1 1 5 1 1 72 1 1 1 1 3 6 1 1 3 1 1 6 1 2 1 16 1 2 1 2 1 1 2 6 9 1 1 2 13 1 1 3 1 2 1 1 5 1 7 24 1 1 3 44 45 1 1 3 1 5 51 1 1 1 4 1 1 3 1 60 1 1 3 1 1 1 3 1 69 1 1 2 4 1 1 1 1 1 1 11 1 2 83 1 1 2 3 1 6 1 1 3 1 2 1 2 1 2 1 4 18 19 1 1 3 4 5 1 2 1 4 10 1 31 32 1 1 1 2 4 5 1 2 8 10 1 2 1 4 1 2 1 4 5 1 2 8 1 2 1 12 1 14 19 1 2 1 4 5 1 1 27 1 2 3 1 2 6 1 45 1 1 1 4 5 1 2 3 1 1 3 1 5 1 1 2 1 4 1 1 1 4 1 11 20 21 72 1 2 1 1 5 6 1 1 9 10 1 12 13 1 1 3 1 2 3 1 21 1 1 24 1 2 1 2 1 1 2 1 220 1 2 1 4 1 2 3 4 1 1 3 1 1 2 1 4 1 2 1 12 1 14 1 2 3 4 1 2 1 1 3 4 25 1 2 1 2 1 4 1 6 1 2 3 4 1 1 7 1 2 1 4 12 1 14 1 1 1 24 1 2 1 2 1 32 1 2 3 1 2 1 2 1 4 5 68 1 2 1 1 5 6 1 2 …

Example 3:

Input: 1857 400737860 486000306 14620771 857442236 522787268 954546859 242629552 528485441 193049631 475401529 970330406 89426398 22177158 401914108 610739358 972051013 835548318 285694874 598547090 38556205 176670006 605861884 808065123 27639984 732541675 387125522 678905267 637626406 963384845 159631510 573468305 889494180 986081958 370512913 142482515 832752305 51908463 538894068 53105909 463452984 516022447 311665296 945743190 712139696 596915226 134552082 658778138 19492104 162561911 154572386 308319608 685526928 982133821 865277889 187149279 608350340 719155803 869254214 651149204 267171207 645027774 271465909 756907915 901490701 317084909 983824471 714192570 903082763 752837557 553607585 576086630 690212704 965325570 44841120 288745807 829134745 181085614 314364330 529560320 229337913 7274…
Output: 1 2 1 4 1 6 1 2 1 2 11 1 1 3 4 16 1 1 2 1 2 5 6 1 2 1 2 1 13 1 2 3 33 1 1 3 1 2 1 2 3 1 10 1 1 1 3 1 2 1 4 8 20 1 1 2 3 5 1 1 2 1 5 11 1 33 1 2 1 1 2 3 7 1 2 3 1 2 3 1 5 1 1 2 4 1 1 12 13 17 1 26 1 1 2 3 5 1 2 1 2 1 1 1 2 14 1 1 2 4 1 2 21 1 1 1 3 1 1 2 1 30 1 2 3 1 2 1 129 1 1 1 2 1 2 1 8 1 1 1 1 3 5 1 2 8 1 2 1 1 5 1 2 3 4 1 6 12 1 1 32 1 1 1 36 37 1 2 1 2 1 1 3 1 5 1 2 1 4 12 1 1 1 2 5 1 1 3 21 1 62 1 2 1 1 5 1 7 1 2 1 4 1 6 1 1 1 4 1 2 3 4 9 1 2 1 2 14 1 1 1 2 1 5 1 1 3 1 1 6 1 1 2 1 1 12 1 20 1 1 2 4 1 6 1 2 1 10 1 12 1 2 1 2 3 1 2 8 1 1 11 1 2 1 1 1 1 3 6 79 1 81 1 1 3 4 1 1 1 3 1 6 7 1 2 14 1 2 1 1 3 1 7 1 23 1 2 1 2 5 6 1 1 32 1 2 1 1 1 4 7 1 2 1 2 1 1 2 1 2 8 1 12 20 1 2 3 1 2 3 1 2 1 143 1 1 3 4 1 6 1 1 214 1 1 3 1 1 2 1 1 2 10 1 2 1 2 3 1 1 2 1 4 6 1 2 1 2 11 1 1 1 3 1 5 1 2 249…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Piper and the Wild ledgers - MEDIUM Coding Problem | CodeTikki