CT53842

Farhan and the Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the orchid house of Bloomglass, Farhan studies rows of beacons entries. One clean number will settle the guild's oldest argument. 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: 1712 994835632 466466210 314654556 256634179 897083889 235686321 518255870 537097106 680983985 678313395 106727135 882684500 646940794 292874000 890266951 346565621 723563169 582778987 545906311 953479304 543793725 126728935 923118598 261454150 977628954 981344025 971320351 313119754 780455812 780197769 278737428 78098192 776426862 935169976 983670102 284931273 143105641 67878949 621757936 342720127 27269461 632348344 304182981 753097619 841778091 292627785 16598147 661964712 445283708 855491450 325731205 410713628 96807687 429403024 822593428 352528111 271642128 814839284 852412916 936343363 77958904 760344015 467548788 314426805 956449231 989375690 100144606 542868888 531214514 994898186 719816862 496879021 106857075 862727516 782602198 759481676 799365532 313557912 169379906 427518749 5…
Output: 1 1 1 1 4 1 2 3 4 1 1 7 1 1 10 1 2 1 1 19 1 1 3 1 24 25 1 1 2 1 1 1 3 7 34 1 1 1 4 1 1 7 1 9 10 1 1 3 1 15 1 2 1 4 5 1 1 3 9 25 1 2 1 1 30 65 1 2 1 70 1 1 1 4 1 1 3 1 1 3 4 1 1 7 15 16 1 1 3 1 5 1 1 1 1 3 1 5 1 1 2 11 12 34 1 1 3 4 1 1 2 4 43 1 2 1 2 1 1 5 1 2 1 1 2 1 14 1 1 60 1 2 1 1 1 2 5 1 2 1 1 10 1 1 3 4 1 1 3 4 5 82 1 2 1 2 1 1 1 1 2 1 1 6 1 1 13 1 17 1 19 1 1 2 1 24 1 2 1 1 2 1 5 1 9 1 1 2 4 1 1 122 1 1 1 3 5 6 1 8 1 1 2 1 4 6 1 1 3 10 1 1 1 4 1 1 1 3 9 28 1 2 1 2 1 2 1 8 1 1 11 1 1 3 4 16 1 1 1 4 1 2 1 2 1 1 7 1 9 14 1 16 1 1 2 64 1 1 2 190 1 192 1 1 1 2 1 2 1 4 1 10 1 2 1 1 5 1 1 2 19 1 21 1 2 1 2 1 2 1 8 1 2 1 1 5 1 2 3 1 2 3 20 1 305 1 1 3 1 2 1 4 1 1 2 8 1 2 1 2 1 14 1 1 3 18 1 1 1 3 4 1 1 3 8 1 2 1 4 1 2 37 1 1 2 3 1 5 1 1 2 3 11 1 1 1 15 1 1 2 1 5 1 1 3 4 1 2 1 2 1 2 1 2 7 1…

Example 2:

Input: 2697 490540155 271927661 718398293 331503966 546379486 267671141 363154034 874157803 947987132 16662472 573934482 739883304 350671344 356808642 701369414 395846528 591423622 323163439 834325854 104215061 448043126 544236163 532400668 188611812 296273264 84238006 285130425 976233710 346314422 817647548 674712931 264171967 486479708 726332173 135946850 386671657 718260063 884107836 266319473 696777014 52977252 452541922 436171666 769487464 660603867 31647247 3781085 242798444 261832543 170076671 701310998 765468037 992401332 974388496 67164760 217083520 713484930 952600258 700874255 185070455 704737178 612284083 427713510 527834873 124428661 198103272 251227303 735841898 174055183 124938742 116407495 719523773 739927609 921727296 169935397 211617429 618004433 368816553 46887011 476933310 450…
Output: 1 1 3 1 2 1 2 8 9 1 2 3 1 2 3 1 2 1 10 1 2 3 1 1 2 1 2 28 1 2 1 1 2 4 1 2 3 10 1 2 1 2 1 6 1 1 1 3 4 1 7 8 53 1 1 2 3 4 1 1 3 1 1 2 1 2 3 10 1 1 1 4 15 16 1 2 3 1 1 3 1 1 25 1 1 28 1 1 2 3 5 1 1 2 3 1 11 12 1 1 1 1 2 1 1 2 1 2 1 57 1 2 1 2 1 4 1 2 7 10 11 1 13 1 1 3 4 5 6 1 2 1 2 1 1 2 1 9 16 87 1 2 1 4 1 2 1 2 3 6 1 1 3 4 1 2 3 1 2 1 7 1 2 1 2 5 1 1 29 1 31 1 2 1 2 5 6 7 1 2 1 11 1 2 1 1 3 1 7 1 20 1 1 2 4 1 1 1 2 3 10 1 2 1 1 1 4 1 38 1 1 2 3 5 1 2 3 1 2 1 2 5 1 10 1 1 1 1 2 1 2 1 1 2 3 12 1 2 25 1 32 1 1 1 2 5 247 1 2 1 1 3 1 7 1 2 1 2 1 4 1 1 16 1 2 1 4 5 1 2 1 9 1 2 1 2 5 1 2 3 1 2 3 1 2 6 1 1 1 1 3 6 1 17 1 2 1 4 1 2 3 4 56 1 1 3 4 5 6 1 1 9 1 2 1 2 1 1 16 1 1 2 3 4 1 2 1 8 1 1 1 3 1 1 15 17 1 2 1 1 22 1 24 1 2 1 4 5 6 1 2 1 10 1 1 3 1 5 1 2 1 1 5 1 2 1 2 1 26 1 1 1 2 3 4 1 6 9 1 1 3…

Example 3:

Input: 365 502605251 559498798 223603381 770249937 54180074 151019091 409020244 651730864 389596515 220899585 56840961 813853771 855338040 453161157 184435516 48386479 906356808 827516606 791499673 32790747 257262420 161519234 273580745 342873279 672231688 493235521 763178926 288908415 139627304 139353623 215238700 189511605 269936965 790229745 807474620 772466902 738766717 321216237 323269352 400114080 736387276 152436855 400124070 941434658 390758465 855505337 171543744 536293610 431199011 410086511 949017620 475005833 830466696 888968549 123809268 17968645 541652721 861854303 181446523 516508187 421544828 339539684 714188786 182953930 273931527 62881111 840366823 488498528 40888762 333430955 911382584 822168267 897666141 742820871 227321780 27093615 347807466 761290376 746653362 226883015 1709…
Output: 1 2 1 4 1 2 3 4 1 1 1 12 13 1 1 1 17 1 1 1 2 1 4 5 6 1 8 1 1 1 3 1 5 15 17 1 1 1 2 3 4 1 2 44 1 2 1 2 1 1 51 1 2 3 1 1 3 4 1 2 1 1 5 1 2 1 9 1 1 2 20 1 2 1 1 1 3 5 1 1 1 3 1 11 1 2 1 2 38 1 91 1 1 2 1 2 3 1 5 1 10 1 2 13 1 2 1 2 1 2 1 2 1 1 9 1 11 27 1 1 1 2 3 6 1 1 9 128 1 1 3 1 2 1 2 3 1 5 1 7 1 1 3 1 1 3 4 1 6 1 1 24 1 1 1 1 5 30 1 1 3 4 1 1 1 3 1 2 1 1 43 1 2 3 1 5 6 1 2 1 2 5 1 1 8 9 16 60 1 2 3 1 2 194 1 1 3 1 1 6 1 1 1 1 1 6 1 2 1 4 1 1 19 1 1 2 23 1 2 1 1 5 1 2 3 1 2 1 12 1 1 2 1 5 1 19 1 2 3 4 1 2 1 2 5 1 53 1 2 1 2 1 1 1 4 1 1 3 4 1 2 7 1 2 3 1 1 17 22 1 1 1 3 5 1 1 2 4 10 11 1 1 1 3 5 1 1 1 2 5 1 1 3 25 1 1 1 2 3 1 1 3 9 1 1 2 1 4 1 6 1 18 1 1 2 69 70 1 2 1 1 2 4 5 1 1 2 1 135 1 2 1 4 1 2 7 1 1 3 1 2 1 1 2 16 1 18 1 2 1 1 3 6 1 2 9 1 1 3 1 1 2 7 1 1

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Farhan and the Streak Back - MEDIUM Coding Problem | CodeTikki