CT55197

The Streak Back of the Solar beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the ink district of Scriptoria, someone must certify the cargo before shipping. This year the task falls to Wynne, 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: 2061 469281185 813352438 385340657 40198904 164180477 772049931 380179004 728162582 322460296 233908720 901218452 274138369 637390602 349136829 792085998 308983289 925203194 337983233 989849776 771662410 323056493 156403379 473062496 763083188 428337060 191201136 80416013 987417642 533530855 896597945 828810058 832069199 558449368 606093063 243375408 699619264 997362245 229060766 19082739 214131005 989359099 189859556 587592186 780343186 148331664 999632249 166949667 8762384 966341351 187536821 489793476 14723843 188785587 318119884 339509976 166750941 100575487 51291822 366419632 907017550 182195145 971165437 117214154 907190004 687063794 692069270 283264658 655974617 556602065 911826983 272109259 441916293 230369254 471580073 291597132 539093835 846317822 1658106 26194211 475595830 70511…
Output: 1 2 1 1 2 4 1 2 1 1 11 1 2 1 4 1 17 1 19 1 1 1 3 4 1 1 1 9 1 2 1 2 1 2 1 4 37 1 1 2 4 1 2 3 1 46 1 1 3 1 2 1 2 3 4 1 1 1 8 11 1 16 1 2 1 2 1 2 1 8 1 2 1 4 1 6 7 1 2 3 4 1 6 1 2 1 10 1 19 1 1 1 2 1 1 5 6 1 2 10 1 13 1 15 59 1 1 3 4 1 2 1 4 5 1 2 1 2 1 1 75 1 2 1 1 2 3 1 1 1 2 9 1 13 1 1 2 1 1 19 1 2 1 1 1 4 26 1 2 1 4 31 1 1 2 3 5 1 7 8 1 1 3 1 1 3 1 1 3 1 19 1 21 1 1 1 4 1 1 3 8 1 2 3 4 1 2 1 2 1 2 1 8 1 43 1 1 77 1 2 3 1 1 1 1 5 1 1 88 1 2 1 1 5 1 1 96 1 1 3 1 1 6 1 1 1 1 1 3 5 1 1 8 17 1 1 3 1 2 1 2 5 1 2 1 2 1 2 1 2 5 1 2 1 2 3 15 1 1 2 3 1 6 1 2 3 1 5 12 1 2 38 1 2 3 4 1 1 7 1 2 10 49 1 1 1 1 3 1 73 1 2 1 2 1 2 3 1 1 8 11 1 2 1 259 1 1 2 1 5 1 2 3 1 5 6 1 8 1 2 3 1 1 2 4 5 1 7 1 2 1 22 1 1 2 1 32 1 1 3 4 1 38 1 1 41 1 2 3 1 1 2 4 1 1 3 11 1 2 1 4 1 2 1 8 1 10 1 2 3 4 1 2 3 1 2 1 11 1 1…

Example 2:

Input: 1704 716621964 988285060 197599670 357546074 587129660 14018746 404588826 260566053 611403697 68288944 510745929 827063203 768973583 824250114 336614727 112399815 611948452 259407947 643304464 204450021 318060794 274887043 265255351 549324274 399708896 798445437 615321712 774228910 813879282 481421149 448038618 136604332 883071095 34056874 481141183 486889412 785311646 406691207 792033414 613305804 142018624 166537125 312393144 477776201 31670379 782907021 853731183 70299818 854460572 712503585 135061692 513799137 785017227 985703176 290415650 887542474 427533229 445074851 860779186 335655090 687586895 654386713 307070684 383854757 431464261 147747829 547750334 84784619 184018694 731588265 409131327 219802467 78193602 852290729 398449155 110527281 985695803 776938399 855745224 152304764 92…
Output: 1 2 1 2 3 1 2 1 7 1 2 10 1 2 1 1 3 1 5 1 2 1 1 5 1 12 1 2 15 1 1 1 31 1 2 3 4 1 6 1 1 2 3 4 1 7 14 1 16 1 1 2 4 52 1 2 1 2 3 1 2 1 1 2 3 1 5 1 2 11 1 1 1 15 1 1 23 1 2 1 4 1 2 1 2 3 4 1 1 7 10 15 1 2 1 1 5 6 1 2 1 1 2 3 1 2 1 2 1 6 19 1 2 3 1 1 3 1 1 9 1 2 1 1 5 1 127 1 2 1 2 1 2 3 4 1 2 1 1 9 1 1 3 1 145 1 2 3 4 5 1 7 1 9 1 2 3 4 1 2 3 8 1 1 3 1 2 6 1 2 1 2 28 1 2 3 1 2 1 4 1 2 1 11 1 13 1 1 1 1 1 4 20 1 2 1 4 5 1 7 1 2 1 4 5 1 1 2 16 1 1 2 1 2 3 1 2 3 1 8 76 1 1 1 4 5 1 1 1 2 5 1 1 3 1 1 1 17 1 2 1 2 1 1 3 4 1 1 1 1 106 1 2 3 1 2 3 1 1 9 1 11 1 1 3 1 16 17 1 2 1 21 1 1 2 1 2 6 7 1 1 3 4 5 1 2 1 4 1 1 7 1 1 1 3 12 13 1 2 1 4 18 1 1 21 1 1 1 3 5 1 28 62 1 2 1 1 3 6 1 1 2 1 2 1 4 1 1 1 17 1 2 3 4 1 2 7 8 1 10 1 2 3 1 5 1 1 1 2 3 4 5 1 14 1 1 1 2 1 5 6 1 2 1 4 1 1 1 4 9 1 121 1 1 2 1 1 5 1 2…

Example 3:

Input: 2060 126345088 882235732 260710429 467125975 960363442 4657520 669794411 879488197 990584418 643715091 445875572 720882134 163038844 731604216 511587997 936972380 122187010 54738973 715757575 816713309 970710803 755872728 59908263 440620 515248010 841407029 140480380 214695824 411255041 328762604 457627033 151012156 502438376 196421305 505425724 652582931 661781897 701928725 667136100 248421691 411432576 514439909 199654096 267912752 905992207 111804517 99628546 668863341 304850964 802356075 182783982 110939658 889651721 369463649 468651841 945936320 657811205 787355431 137623775 105697798 514463826 639546144 727807292 965982749 178644909 13476142 5142287 948753991 198082062 916621119 161233774 404342961 276801712 202173284 22490061 413907096 645167122 535056115 950393532 404023660 7246249…
Output: 1 2 1 2 5 1 2 3 9 1 1 3 1 5 1 7 1 1 3 4 12 1 1 1 3 5 1 2 3 1 5 1 7 1 9 10 11 12 1 1 2 3 1 2 24 1 1 3 1 5 1 1 8 1 2 35 1 2 1 1 3 4 5 43 1 1 1 4 1 2 1 2 1 1 1 6 7 1 15 1 1 3 83 1 1 3 1 88 1 2 1 1 1 3 5 1 9 1 2 1 1 3 1 2 6 1 2 1 2 1 6 7 1 1 1 2 3 1 7 1 1 1 1 1 2 1 39 1 1 1 3 5 1 2 1 4 1 1 7 1 9 1 1 1 4 1 1 1 1 4 10 64 1 2 3 4 1 6 1 2 1 1 11 1 2 1 15 1 2 1 2 3 6 7 1 1 2 1 2 1 1 3 1 2 1 2 12 1 2 1 2 1 1 1 4 1 1 2 4 11 1 1 14 52 1 2 1 1 5 1 2 8 1 1 1 3 1 1 15 1 2 3 1 1 21 1 2 1 1 3 1 2 3 1 2 1 7 1 35 1 1 3 1 1 3 4 1 9 1 2 1 2 14 1 2 1 18 1 1 21 1 2 59 1 1 3 1 1 6 1 1 9 1 1 3 1 1 6 1 8 1 1 1 3 133 1 1 3 1 1 6 7 1 2 1 2 3 1 7 1 9 1 2 3 13 1 2 1 2 1 1 1 8 9 1 2 1 2 1 2 3 17 1 1 2 1 35 1 2 38 1 2 3 1 1 2 7 1 1 10 1 50 1 2 3 4 1 2 3 1 5 1 2 1 9 1 2 3 1 1 15 1 2 1 4 1 1 7 1 9 1 1 2 13 1 2 1 1 2 1 2 1 …

Constraints:

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

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