CT44897

Wayward beacons Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Rhea inherited the signal tower at the cliffside roost of Stormrest along with its curious bookkeeping system for beacons. Time to make sense of it. 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: 1416 649207842 318408748 795523256 301978110 885887898 75959570 23534835 178245776 377141277 550416940 231565487 641102092 696420911 66379713 262313558 60777625 987217025 245663552 340514581 245605830 377800444 797101174 598183707 98331495 611851835 72213371 421802265 485295978 95638044 646352278 704545199 911901249 584778239 35698113 695128621 44408743 64497586 179213057 246675406 436379060 231846986 87363230 178404342 478616485 508616694 111606887 307087357 926135285 631442222 985752157 903557163 117269158 280013363 683043823 474647883 702905749 970198167 265470542 690830116 508085516 376441679 755800500 213947781 861448857 898429536 232698672 58445197 890995852 398423697 840381431 787172422 668718981 511307394 811831336 755669473 342781738 879712941 167281138 623032496 431083115 6445491…
Output: 1 1 3 1 5 1 1 3 4 5 1 7 8 1 2 1 17 1 2 1 4 5 1 1 3 1 2 3 1 8 9 15 1 1 3 1 2 3 4 5 1 1 2 9 10 1 2 31 1 33 1 1 2 3 1 5 7 1 2 1 1 5 1 7 8 1 1 3 1 2 1 1 1 4 1 1 9 1 2 1 4 1 1 3 28 1 2 3 1 2 1 1 5 9 1 1 3 1 42 1 2 1 2 5 6 1 8 1 10 1 12 1 1 2 1 1 6 1 2 3 1 1 1 7 1 2 1 2 3 4 1 2 7 1 2 3 13 1 2 1 2 1 2 1 1 3 8 24 1 1 3 1 1 3 1 1 107 1 1 2 4 5 1 7 1 9 1 2 3 1 14 1 1 17 1 19 1 1 1 2 24 1 2 1 2 3 1 7 1 1 1 11 1 2 1 2 1 6 1 2 20 1 1 3 1 2 3 1 52 1 2 162 1 1 3 1 2 3 1 8 1 10 1 2 1 1 1 1 5 1 2 1 2 12 1 1 2 1 2 3 7 1 2 244 1 1 1 3 5 1 1 8 9 1 1 3 1 2 3 1 1 3 7 1 2 13 1 15 1 2 3 1 2 6 22 1 2 1 1 2 4 1 2 3 4 5 12 13 1 2 3 1 5 19 1 2 3 54 1 2 1 2 1 6 1 1 3 4 5 1 1 1 15 70 1 1 2 1 4 1 2 1 1 10 11 1 2 3 1 5 1 1 3 1 1 1 12 1 95 1 1 1 1 1 1 7 1 1 2 1 1 3 6 1 1 1 4 5 6 1 1 3 1 5 12 1 1 3 30 1 1 2 3 1 2 37 1 1 2 …

Example 2:

Input: 2106 80543682 450259068 578176669 824210896 617627250 714313437 78457576 692317166 106460133 732820119 794686433 936106547 778108094 798318231 899829679 476900614 223769392 291157866 357859181 408022399 135924766 90826262 459119505 788220494 269821466 669531064 198363382 997531587 442017140 483020878 916241535 899043425 418733408 599227310 223566766 679231931 739206365 5473797 9816066 654192815 848175983 112312579 49573618 434583957 834637491 759053125 535705493 652952923 806623427 134384479 777152152 862908442 85872324 828665037 855492967 797524739 840274730 276674423 627048315 57532845 824429788 602765197 141740244 919768153 889915808 425024533 470532127 135705232 122041967 933043540 21201921 290254837 349177801 430025180 994475092 908910781 314862242 350560579 840254105 62334909 9332827…
Output: 1 2 3 4 1 2 1 2 1 6 7 12 1 2 3 1 1 2 3 4 1 1 7 9 1 2 1 28 1 2 3 1 1 2 1 4 5 1 2 3 9 1 1 3 4 1 1 2 4 1 2 20 1 2 3 1 2 1 2 1 4 1 1 36 1 1 2 1 1 42 1 2 3 4 47 1 1 2 3 1 6 1 2 1 10 1 1 1 2 5 1 1 8 1 2 3 4 1 1 3 1 1 2 4 1 6 1 1 3 1 5 1 1 3 1 5 1 2 1 2 28 1 1 3 4 1 2 1 4 1 2 3 4 1 1 2 1 5 1 1 3 4 1 2 7 61 1 2 3 4 1 6 7 1 2 3 1 5 1 2 15 1 2 1 4 1 1 1 3 5 1 7 1 9 29 1 2 1 1 1 1 7 1 1 2 4 1 13 1 1 2 4 1 6 1 2 1 23 1 2 126 1 2 1 2 5 1 2 8 210 1 2 1 4 1 2 7 1 2 1 2 1 2 1 2 1 1 1 1 3 21 1 1 1 4 1 1 2 4 1 1 2 1 5 6 1 8 1 14 1 16 1 2 1 1 3 1 5 1 2 8 27 1 1 3 4 1 2 1 60 1 1 2 4 1 2 1 2 5 1 2 1 1 2 1 4 8 1 2 1 2 5 1 2 1 17 1 1 2 21 27 302 1 1 1 3 1 5 1 7 9 1 2 1 4 1 6 1 1 3 1 2 1 2 1 1 7 8 1 1 1 2 1 2 1 2 1 2 1 38 1 2 1 1 43 1 2 3 1 2 1 2 51 1 2 1 4 1 2 1 4 1 2 3 1 2 1 1 2 6 7 1 9 13 22 1 2 1 1 2 4 1 2 1 …

Example 3:

Input: 1122 622975987 394916511 234627916 263860919 967109327 622367671 935311731 994376660 898939366 49749120 256001871 782327182 750603611 335936027 98169366 786414099 489261373 567387401 371107651 9638979 702963451 312408792 535709341 247633272 971461719 55058779 310781127 124509936 545461442 798155416 265210713 205524466 209740099 118465856 653755912 599449334 412454737 169058326 787172939 73299137 744202688 773371156 130867236 545282946 46268365 742292273 713153968 340599654 266252033 272029205 727507826 974058139 348307172 804386968 162175090 531937434 921036190 913612278 124114137 572567489 620174864 518411953 635369163 355347857 342100742 683536515 645733106 543442972 880881752 588610109 377071618 314116327 658868596 535713122 673985109 814973851 940708988 56741776 259188300 703672219 623…
Output: 1 1 1 2 5 1 2 8 1 1 2 3 1 1 1 7 1 2 1 1 5 1 2 1 17 1 2 1 4 5 1 1 2 1 5 1 1 1 9 1 2 3 1 2 1 4 1 1 1 2 5 44 1 2 1 2 5 1 1 2 3 1 5 1 1 8 1 1 11 1 1 1 4 1 6 7 25 1 2 3 1 2 1 32 1 1 1 1 3 1 2 3 7 1 1 3 1 2 1 1 8 9 18 1 1 3 4 23 1 1 1 1 4 1 7 64 1 1 1 1 3 5 1 2 1 2 1 4 1 13 14 1 1 2 1 1 20 1 2 1 1 3 26 1 1 2 3 1 5 1 8 1 2 1 4 1 14 1 107 1 153 1 2 1 2 1 1 3 1 2 3 1 2 1 12 1 2 17 1 2 3 1 1 2 1 4 6 1 1 29 1 2 1 1 3 1 7 8 1 10 1 1 3 1 5 1 1 1 9 49 1 2 1 4 5 1 2 1 1 5 1 1 3 1 2 6 227 1 2 1 1 2 3 1 1 3 4 1 9 11 1 15 1 1 1 4 1 1 1 1 9 1 1 1 1 5 15 1 1 3 4 35 1 2 3 1 1 3 1 2 3 4 1 2 3 1 5 1 1 8 54 1 1 1 4 1 60 1 2 1 1 65 1 67 1 1 1 4 1 2 1 2 1 10 1 2 1 1 3 4 1 2 19 20 1 1 3 4 1 1 1 4 1 6 1 1 3 1 1 16 1 1 2 20 1 1 1 111 1 1 3 1 1 3 4 1 9 1 11 1 2 1 2 1 2 7 19 1 2 3 1 2 1 1 3 6 1 1 12 1 1 1 2 3 1 2 1 4 1 …

Constraints:

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

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