CT46115

The registers at Skyharbor

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the floating docks of Skyharbor as Archivist unrolls the day's manifest of registers. 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: 828 2267984 535547019 380968642 853303770 355332420 963861733 430173252 244101764 948429827 734994884 23116298 186688042 313257915 377769973 97244301 812971103 928761400 357488424 65443886 359926795 242450091 37750851 299526862 861199316 501272545 404443164 943331400 488429346 482475789 701872054 56662382 535941564 59799052 706359217 355676446 39173977 768155203 788091644 705433380 981485715 655607883 345940780 283291692 658571911 906007741 543070131 290930516 733755898 271379830 641410462 182002426 599503209 492053459 297662504 757314875 12611508 817109335 36536695 218367918 278158560 779485948 683748804 618548021 344926155 615072761 42681912 315495298 764600877 812767748 544270935 951101970 737307791 69892264 975104103 325765467 577221333 385472944 699648202 793420803 771903670 624751737…
Output: 1 2 1 4 1 6 1 1 3 1 1 2 3 4 1 7 8 1 1 3 1 1 3 7 1 1 18 1 1 3 1 2 1 7 1 1 10 11 1 40 1 1 1 4 5 1 1 3 1 2 1 2 1 1 10 1 12 1 2 3 4 1 1 1 2 1 2 7 12 1 31 1 1 34 1 2 1 4 5 1 1 1 1 2 1 2 5 7 9 16 1 2 1 1 5 1 7 1 2 3 1 5 1 2 3 1 2 1 4 5 1 1 3 4 13 1 1 1 4 5 1 2 26 1 1 1 4 1 2 1 1 5 1 44 1 2 3 1 5 1 1 3 1 2 3 12 1 2 1 2 1 1 5 1 21 1 2 1 1 3 4 7 1 2 1 11 1 2 3 1 97 1 1 1 3 1 6 1 179 1 1 3 1 2 1 1 3 1 2 1 4 5 1 12 1 2 3 1 20 1 2 1 2 3 6 1 2 1 2 1 2 1 4 1 2 1 1 1 1 21 1 1 1 2 4 6 1 1 9 10 11 1 2 3 1 1 3 1 5 1 1 2 4 24 1 1 1 2 5 30 1 1 2 1 2 36 37 1 2 1 2 3 1 2 1 4 1 9 1 11 1 1 3 1 2 3 1 21 1 2 3 1 1 2 1 107 1 1 2 4 1 1 3 1 1 2 4 1 1 3 1 2 6 1 1 3 21 1 2 3 1 2 3 7 1 30 1 1 1 2 5 1 2 3 1 2 1 2 3 1 5 1 17 1 2 1 1 1 23 1 2 1 1 1 2 3 4 1 10 1 2 3 1 5 1 2 1 2 20 1 2 3 1 2 1 2 81 1 2 1 2 3 4 1 2 3 4 1 1 11 …

Example 2:

Input: 100 694638231 433864361 753917757 357693244 775818986 247287335 980292233 491226303 191924609 466557599 270616013 545316584 158695017 844836308 691117939 899223648 953314226 547411693 680046929 148510791 314336818 410479173 253226625 464395090 471233849 616014468 371566358 27829480 553964223 505780372 453065920 138553262 361908292 963639138 643542319 637895755 148064630 525193364 211057843 371189352 596100230 405149162 950932284 254774697 982654890 178306022 440910107 510471372 210786013 816790457 547439547 332819414 913283402 426013619 281649878 446649979 436376311 390176654 922185291 487452184 325132262 449442038 8389724 727201055 467599797 796939208 200986502 424460283 894925341 763357967 542692680 235598376 841039355 876336870 500929879 181887591 190497679 10630715 204371651 777693227 …
Output: 1 1 3 1 5 1 7 1 1 2 1 5 1 7 1 9 10 1 2 1 2 3 1 5 6 7 1 1 3 1 1 1 2 27 1 1 1 2 1 2 5 1 9 1 45 1 2 3 1 5 1 1 8 1 1 3 1 1 14 1 1 2 1 5 1 7 1 2 10 1 1 1 4 5 1 1 2 1 4 6 1 1 1 1 26 1 42 1 2 3 1 1 1 4 1 1 3 11 1 2

Example 3:

Input: 3429 295689879 88479687 938926922 686300144 210368097 756200505 765991036 20635354 316453959 587218590 797424639 633869893 282457280 508992918 306600152 634843153 354967848 327853603 262580658 249245162 769879093 568866580 384085983 466262329 580001132 342793895 515383905 879173265 97576576 143773991 714210341 443583742 563998640 316819712 402654578 385172459 639159581 921545240 461339716 8453854 712562499 779727681 847715654 114166204 656336957 564160392 820008907 335212432 936950556 799943445 854882590 135176288 940028611 833674295 510867289 637963575 753411952 136932593 792814323 233527263 997600125 262682860 40328684 389663041 588287244 706683364 984945315 797783004 480570971 626198981 884926598 527338170 594641122 479676143 72732285 935255664 19995410 662343634 199773091 158332345 930…
Output: 1 1 3 1 1 3 4 1 2 3 8 1 1 2 1 5 1 1 1 1 10 1 1 2 4 1 2 25 1 2 3 1 2 1 2 1 6 35 1 1 3 4 5 1 2 1 4 1 46 1 2 1 53 1 1 2 3 1 5 1 61 1 1 3 4 5 6 1 1 2 4 1 2 1 1 9 1 2 1 1 5 1 1 2 4 5 1 7 1 2 1 25 1 2 28 1 2 1 1 3 4 1 1 3 1 9 1 11 1 1 3 1 2 3 7 1 2 1 2 3 1 61 1 2 3 1 1 3 4 8 1 2 1 2 1 1 7 1 2 3 1 2 1 4 1 2 3 4 1 2 151 1 2 1 4 5 1 2 1 4 5 1 2 8 1 2 3 1 1 2 4 1 1 3 1 9 1 2 1 1 5 26 1 2 1 2 1 1 1 1 3 41 1 1 2 4 1 2 7 8 1 1 203 1 2 3 1 2 3 4 1 2 7 8 1 2 11 1 1 2 4 1 2 3 4 1 21 1 1 24 1 1 30 1 2 3 1 2 1 1 38 1 2 1 2 3 6 1 46 1 2 3 4 1 2 3 4 1 2 11 1 1 3 1 1 1 4 1 2 1 4 12 13 1 2 3 1 5 6 1 8 22 1 1 1 2 84 1 1 1 1 2 1 6 1 1 1 10 1 1 2 1 15 101 1 2 1 4 5 1 2 1 2 10 1 2 1 4 1 1 17 1 1 1 3 5 1 1 3 1 5 1 2 13 1 1 16 1 1 3 4 1 2 1 8 1 1 1 4 1 1 15 1 17 1 1 2 1 2 6 1 1 3 1 1 1 1 2 65 1 1 2 4 5 1 1 1 4 1 2 1 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.