CT54503

The Streak Back of the Granite beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the fen lights of Will-o-Wisp pays by the answer, and Zane intends to earn it. First: the full register of beacons. 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: 3117 470793947 481119484 698173271 773012477 733629060 386680440 128288890 971327531 56099219 535381236 670042604 154503674 269605673 108729412 733046209 208035896 534689545 728648020 630944236 727598972 618187037 401139101 382222114 654589804 510598446 413092195 372906548 263248165 996238606 451447402 650360252 850215335 797085956 502221251 56559806 277199252 962184701 108732838 533282910 745160425 937142952 56314124 476572328 489517126 215540003 233719187 802305473 729002110 568195448 175456386 128472105 218032176 744736951 188892544 911405367 731869872 632738260 487540360 41504977 263204640 103896914 432030789 275092645 939829970 781937890 911781341 960842681 560700171 970332121 74871842 720382892 882291139 331179490 547233094 300704462 256361529 577844559 551265296 884704883 180477712 …
Output: 1 2 3 4 1 1 1 8 1 2 3 1 2 1 7 1 2 3 1 2 1 1 1 4 1 1 1 1 29 1 2 3 1 1 1 2 8 1 2 3 4 1 2 3 1 2 6 1 1 1 1 3 6 1 14 1 1 1 1 2 1 4 1 27 1 2 30 1 40 1 2 3 1 2 1 1 5 1 10 1 2 3 1 5 1 2 1 1 1 2 3 1 1 6 7 1 1 1 12 1 1 2 24 1 1 2 3 4 1 1 2 83 1 2 1 1 1 89 1 1 1 3 1 5 6 1 2 1 11 1 1 2 4 1 2 1 1 3 1 5 1 1 1 26 1 2 1 2 5 1 7 1 1 2 4 1 2 3 1 2 3 11 1 1 2 4 1 1 7 1 2 1 4 1 13 1 1 3 1 5 1 2 3 1 1 6 43 1 1 1 3 1 5 7 1 167 1 1 1 2 4 5 1 8 1 1 11 12 1 1 3 1 1 1 2 1 6 10 1 2 1 1 5 1 2 1 4 1 2 1 1 2 4 1 1 1 2 1 1 3 1 13 1 1 27 1 1 52 1 2 1 2 1 2 7 1 2 3 11 1 2 1 2 1 4 1 2 3 10 11 1 1 2 1 2 3 7 1 2 1 11 1 1 1 3 1 6 1 2 9 1 1 12 1 2 26 38 1 1 3 1 2 3 1 1 6 1 1 2 1 2 3 4 8 1 2 3 21 22 1 2 1 1 3 1 67 1 2 1 1 2 1 7 1 1 3 1 2 6 1 2 3 84 1 2 1 1 1 4 350 1 2 1 2 1 6 1 1 2 1 5 6 13 1 1 1 4 1 6 20 1 2 3 1 2 1 1 2 1 1 11…

Example 2:

Input: 2154 718203179 984761075 166869330 565723989 126491853 451012427 953035256 547616174 742337014 49966874 59576930 634926993 896269257 949380016 131090698 456361927 691047124 166432357 123614113 830747187 707654528 693232350 804282984 9536225 765196716 11882380 75223407 578780885 269572819 676067767 477425239 910285688 464844011 705944567 350938607 767004377 653513295 730394892 785534392 38678955 285867498 932365112 262238360 817106726 822812935 454465152 659654584 63848687 185133913 868366441 756049091 843756811 97736030 9090129 224419524 508329826 756590908 821669161 698279504 174127506 955300839 990254688 507843635 721994548 976631881 10318121 952594586 828877267 873064685 839538543 923607314 999757530 722129439 319764007 311464678 114382282 254687573 497455555 28551050 186830299 82939061…
Output: 1 2 1 2 1 2 5 1 2 1 2 3 6 7 1 2 3 1 1 6 1 1 3 1 2 1 2 3 1 5 1 18 1 2 1 4 1 2 7 1 2 28 1 2 3 1 2 1 2 8 1 2 1 1 3 4 5 6 1 1 59 62 1 2 3 1 2 1 2 1 4 72 1 1 1 1 2 5 1 2 9 1 1 1 2 3 1 5 1 7 1 9 21 1 23 1 1 2 1 2 6 1 2 1 33 1 1 3 1 1 2 1 2 6 7 1 2 1 4 1 2 1 4 9 1 2 3 56 1 2 3 1 2 3 4 5 1 2 3 1 13 1 2 1 2 3 1 5 6 1 1 2 25 1 1 28 1 1 3 4 5 90 1 2 1 1 2 1 5 6 9 1 1 2 1 1 2 1 4 6 1 2 1 2 5 1 2 8 1 19 1 2 22 1 2 3 1 1 2 1 2 1 2 132 1 2 1 1 1 138 1 2 3 1 1 1 3 1 1 10 1 2 1 1 5 1 2 1 2 1 1 2 4 7 10 1 2 1 1 3 1 5 6 1 2 1 12 1 2 3 1 1 2 34 1 36 1 1 2 3 1 1 6 7 1 10 11 1 1 1 2 4 1 2 1 2 3 1 11 1 1 2 4 1 2 1 2 1 2 1 2 3 1 2 8 17 30 1 43 1 2 1 2 1 6 1 2 1 4 1 2 1 4 5 1 11 1 1 3 15 1 1 1 4 1 1 7 1 24 1 2 1 34 1 1 3 38 1 1 2 4 1 6 1 1 1 4 5 1 1 3 9 1 1 12 1 20 1 1 3 1 2 3 1 5 6 30 31 1 1 3 4 1 1 1 3 4 1 2 1 9…

Example 3:

Input: 138 868669268 599428297 852670459 269090367 820234298 924697889 93744321 494214290 628461652 569071602 674773561 516546515 902815628 945178332 648467125 454427354 816839699 169248122 717311028 859738276 988689124 730949742 298647632 727829081 968912788 386915279 224050810 482691769 435583623 773649530 627221637 942559023 656652336 485139971 703248490 20508206 251435306 868303283 570801909 800709089 114236433 83555914 519657499 874960750 543103522 335111282 856112034 270933533 72797212 173558364 10714727 576661259 859600739 595201688 181627075 760090419 357816218 443979144 999070613 799064317 163718212 835274236 533677667 628331594 342101807 339322918 366783109 554629450 207244542 199074346 574876879 34713002 983814335 53707510 353992867 429311193 938811785 284213765 679967425 353159099 785…
Output: 1 1 2 1 2 6 1 2 3 1 5 1 7 14 1 1 3 1 2 6 21 1 1 2 4 1 1 3 1 5 1 7 1 1 3 1 2 6 1 2 1 1 3 12 1 1 3 1 1 2 1 5 9 1 1 3 1 2 59 1 1 3 1 2 1 1 3 4 1 1 7 1 14 1 2 3 4 1 2 1 4 1 1 1 12 1 2 3 1 1 2 19 1 1 2 3 1 2 3 8 1 1 11 1 1 2 4 1 1 1 4 9 1 11 1 2 3 1 2 6 7 1 9 10 11 12 1 1 15 1 1 3 30 134 1 1 3 1

Constraints:

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

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