CT40682

The Streak Back of Galeholm

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the zephyr cliffs of Galeholm, someone must outscore the rival chapter. This year the task falls to Iker, armed only with the beacons register. 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: 3822 36113938 273970329 327885435 770002428 639046325 569824645 180862125 430934249 608509611 897205505 403103774 840429563 233542594 565142967 632472465 795588598 449729106 550599268 216099180 946577043 952688755 236696726 530612655 158849226 34904377 567062936 569512286 421686983 172376268 427736351 902254850 719669076 155573818 495884838 950310649 467774205 521384420 435379320 621302218 513688621 394750894 143071325 821212129 361721108 134051405 893571278 280100985 572015704 230417280 562181102 80856225 745419382 264502971 476851344 33391667 913107182 157671193 582197230 93321685 841715935 354039280 321818417 921278393 802644559 496381493 623436835 309336231 163931157 533276826 946440925 339888043 476338654 676163894 689466175 826616057 483893738 213508963 313572831 347540490 422135495 …
Output: 1 2 3 4 1 1 1 2 4 10 1 2 1 2 3 4 1 2 1 20 21 1 2 1 1 5 6 1 1 3 10 1 1 2 14 1 2 1 4 1 1 1 8 1 1 11 1 2 1 2 1 6 1 2 1 21 1 2 1 4 1 1 28 1 1 2 1 1 3 35 1 2 3 4 5 1 1 2 3 4 6 1 13 1 1 3 1 5 1 1 8 1 1 2 95 1 2 3 1 2 1 1 2 1 1 5 1 8 14 1 16 1 1 2 3 5 1 2 1 1 3 6 7 1 125 1 2 1 1 2 1 4 1 1 8 1 1 11 1 2 1 17 1 1 2 4 1 23 1 2 1 1 5 6 1 1 1 2 1 6 1 2 15 1 1 1 3 1 1 7 1 1 2 3 1 5 1 7 8 1 2 3 20 21 1 2 62 1 1 2 1 1 6 1 2 1 1 1 2 5 1 1 10 79 1 2 1 1 1 2 7 1 1 3 1 5 1 2 1 1 17 1 1 2 1 2 5 1 25 1 1 2 1 30 1 2 3 1 2 1 37 1 1 2 1 2 1 7 1 1 3 11 1 1 2 1 2 6 1 1 2 3 11 1 2 1 4 1 2 3 1 5 1 2 1 13 1 37 1 1 2 4 1 6 1 1 3 1 5 6 1 8 1 1 2 1 2 1 6 1 1 2 1 5 1 1 2 30 31 69 1 2 3 1 1 3 317 1 2 1 1 2 6 1 1 1 1 5 1 1 1 15 1 1 2 3 1 2 1 7 1 1 3 1 5 6 1 1 3 1 1 12 1 2 1 24 1 2 27 1 1 2 363 1 1 2 3 4 5 6 1 1 3 4 5 1 1 2 1…

Example 2:

Input: 953 473909564 259993830 415898871 500760300 652539922 141220289 854584289 247674237 393110730 300210610 951156331 866846627 964881657 787356331 484998773 988348486 432361982 216425479 974392135 115384956 18831249 659095770 689443026 753446847 52403696 488138808 390235349 925496881 993099013 517017871 491700245 711217146 857165986 123450268 973687126 277012241 993820524 392620153 760463852 329103735 888532547 982679929 522512714 211833059 448305276 24598739 925805926 23965975 548851210 582073013 449082080 265605087 816251718 179961290 202002667 338679034 588239243 136097491 863431489 234118196 135579863 589845413 919366083 432594728 770505159 989064194 801142237 356720011 762796962 783068078 459532971 119373305 572258732 9101320 457550136 77402798 965585421 862189822 735257355 15424401 7541…
Output: 1 1 2 4 5 1 7 1 2 1 11 1 13 1 1 16 1 1 3 1 1 3 4 5 1 2 1 9 29 1 1 3 4 1 6 1 37 1 2 1 4 5 1 1 2 1 5 1 2 3 1 1 6 1 2 3 4 1 12 1 1 3 16 1 2 29 1 1 2 3 1 1 3 1 2 1 11 1 1 1 3 1 1 1 8 1 1 1 23 1 1 3 1 1 1 2 3 6 1 2 1 1 11 38 1 1 2 4 1 2 3 1 1 3 1 1 2 3 1 9 10 1 2 1 1 3 1 2 1 1 1 4 25 1 1 28 1 2 1 1 3 6 1 2 1 4 1 1 2 4 1 44 1 1 2 4 5 6 1 2 1 4 1 2 1 8 1 1 1 1 19 1 2 1 2 5 6 7 1 1 77 1 2 1 1 2 4 7 1 2 3 1 1 1 3 8 1 2 3 1 13 1 2 3 1 2 3 20 1 1 1 2 1 1 1 2 4 1 1 32 1 118 157 1 2 1 2 3 1 5 1 1 1 4 1 1 3 4 1 2 1 4 9 1 1 1 3 14 1 1 17 1 2 1 4 5 32 1 2 1 2 1 6 1 2 3 4 11 1 1 48 1 1 1 3 1 2 3 1 1 10 1 2 3 1 2 1 4 1 19 1 2 3 1 2 1 4 1 2 3 4 12 13 1 1 3 1 1 2 3 5 1 2 3 1 2 1 2 1 1 10 1 1 2 1 4 1 1 26 1 1 61 1 1 3 1 66 1 1 3 1 1 6 1 1 2 4 1 1 2 1 129 1 2 1 4 1 2 7 8 1 2 11 1 2 1 2 1 1 2 3 9 336 1 2 3 1 2 1…

Example 3:

Input: 972 986892090 287526355 404639498 45270804 150023051 629220018 83837301 903322103 852312058 123721377 853908076 977010594 913521303 601608957 570687026 979604944 442355868 93900757 101998008 331545242 414610090 54767867 610978415 740536138 197127186 905535597 784601264 196541080 755641082 179894764 918823180 639500800 837447942 233195857 534862148 945466368 858002365 922263008 360997254 614883836 3705167 547865877 632435137 368027075 785478740 376076669 248377411 751381289 444347830 524333667 982575520 337187491 70208636 612046805 152236705 410943589 253925222 492746863 622556117 711295222 328730037 705587887 831465482 630689059 808901365 704842138 908593845 475060977 571698692 687064821 54799133 632511321 649640252 273171222 659895405 528605848 430687584 269406558 920757109 284096072 4670…
Output: 1 1 2 1 2 5 1 7 1 1 3 11 1 1 1 15 1 1 2 3 4 1 7 8 1 10 1 1 2 1 15 1 2 1 2 20 1 2 1 2 1 2 5 1 7 1 1 3 1 2 50 1 1 3 1 2 1 4 8 9 1 2 12 1 2 1 16 1 2 3 1 2 3 1 5 1 1 1 28 1 2 1 2 1 6 1 2 1 1 3 1 1 1 2 8 17 1 47 1 1 3 4 1 104 1 2 1 2 3 1 5 1 2 1 11 1 1 3 15 1 2 3 1 5 1 2 1 1 3 4 5 6 9 1 1 2 1 2 3 1 8 9 1 2 1 2 5 15 1 1 32 1 2 1 2 5 1 7 1 2 1 2 3 13 1 2 1 2 50 1 2 1 2 3 1 2 6 1 1 3 1 13 14 1 16 1 18 1 20 1 1 3 1 2 3 7 8 1 1 31 1 1 3 85 1 2 3 4 1 1 3 4 5 6 1 2 1 2 1 1 2 1 4 1 21 1 2 3 1 2 3 1 5 1 2 3 1 10 1 1 2 14 1 2 17 1 1 3 1 5 6 1 25 1 1 2 1 1 2 1 5 1 1 1 146 1 2 1 2 3 4 1 1 3 1 2 10 13 1 2 1 2 1 2 3 1 9 1 1 1 2 1 15 1 2 3 4 1 2 1 1 1 10 1 2 3 1 5 1 1 2 1 10 11 12 38 1 2 1 1 2 6 1 1 9 1 1 2 1 5 1 7 1 2 1 2 5 1 7 1 1 26 1 1 1 1 1 3 1 7 1 1 11 1 1 1 1 1 17 1 19 1 2 3 4 24 1 2 1 1 3 1 2 1 4 34 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Streak Back of Galeholm - MEDIUM Coding Problem | CodeTikki