CT41056

Nyssa and the Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the island market of Coralcove, someone must map a faster supply route. This year the task falls to Nyssa, 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: 1878 917659165 68895839 174728601 910357879 843738408 143858996 555909103 169979832 592009868 913857915 833360001 977496237 285403884 752131322 860237474 63020116 139303078 469150308 614670276 396462743 556745556 330554971 967549335 28046680 474214177 669235418 300716640 202653480 522229945 973529822 759236864 628816424 433371537 853833123 760349295 792354819 353574843 494800267 938871781 863185969 273977507 705565554 646685975 515329078 632178675 20330294 276192805 616571545 616085280 634662994 747751023 666385446 146817862 35890901 477330723 286857399 345737156 370659343 294801708 762136303 918703175 597978903 61565564 6569014 786970023 793342785 431390001 191845664 16010634 164516338 217607837 520128568 194399301 263894964 306812549 230480025 703082866 355123109 854471408 185152586 7491…
Output: 1 1 2 3 1 1 2 1 4 9 1 12 1 2 3 1 2 3 4 1 2 1 11 1 2 3 1 1 3 18 1 1 1 4 1 2 1 2 9 1 1 2 1 1 2 1 2 3 1 7 11 1 1 1 3 1 2 3 1 20 22 1 1 1 4 5 1 1 1 2 4 6 1 2 3 1 11 1 18 1 1 3 4 1 2 3 48 76 1 1 2 1 4 1 2 7 1 1 11 1 2 1 2 5 1 1 3 1 1 2 4 5 6 1 2 9 1 1 3 4 1 18 19 1 2 3 1 2 1 1 3 1 2 1 2 1 6 39 1 2 1 2 1 4 1 1 1 8 1 1 2 3 5 1 1 1 4 1 2 1 1 9 1 26 1 2 1 4 1 1 1 2 1 4 11 1 1 3 1 2 1 4 1 1 21 1 1 2 4 1 2 1 1 5 1 32 1 2 3 1 1 3 1 5 9 1 2 12 1 2 1 2 1 2 3 1 5 1 1 1 3 1 1 2 3 5 15 1 2 1 1 1 1 24 1 26 1 1 1 1 5 242 1 1 3 4 1 1 1 1 1 6 1 1 13 1 2 3 4 5 1 7 8 1 1 2 4 13 1 15 1 2 1 4 5 1 1 36 1 2 1 4 1 1 2 8 9 1 1 2 4 1 1 1 2 18 1 1 21 1 1 2 4 1 1 2 1 1 1 3 1 6 1 2 1 12 1 15 1 1 3 1 1 6 1 8 1 1 3 1 5 1 1 3 1 37 1 2 1 340 1 2 1 2 1 1 5 1 1 3 1 2 1 1 1 2 4 358 1 2 1 2 5 6 7 1 1 2 1 2 1 1 2 4 1 1 3 4 1 14 1 …

Example 2:

Input: 1804 304404733 482733445 398029372 859868170 729002986 260967720 765294773 381711586 538981712 62281101 140812681 29524607 400514034 715823078 564129742 176972803 542872848 357444134 408811971 597807896 961524369 223095691 152116646 565219732 887199733 125384092 27736160 352472824 400541691 508771204 156968618 389383121 784170271 628634627 742083278 95391595 638013048 660626117 765928741 33192010 675309272 234894511 237800500 722853644 404114089 176068095 195585668 878164388 461525071 725148762 802617167 216837496 481758796 622790081 195631084 459945 875319455 885097155 507023744 383062079 312130811 199791488 693437166 560455959 800188831 153110596 197090611 418231487 660925897 469341762 762900422 695317005 572343858 145660575 630421987 911303727 873612870 564965821 653333157 567229815 755…
Output: 1 2 1 4 1 1 3 1 2 1 2 1 4 7 1 1 2 1 2 6 21 1 1 3 4 1 1 3 4 5 1 2 8 1 2 1 2 3 6 1 2 1 2 5 1 1 2 23 1 2 3 1 2 3 1 1 9 33 1 1 1 1 5 1 7 1 2 3 4 1 6 1 1 1 3 55 1 1 2 1 4 1 6 1 2 1 4 1 1 3 1 1 3 4 74 1 2 1 1 3 1 5 1 1 10 11 1 2 1 2 1 1 7 1 2 95 1 1 1 1 5 1 7 1 1 1 1 3 1 2 8 1 2 18 135 1 1 1 1 1 2 1 5 1 2 3 147 1 1 3 1 1 1 2 1 2 7 8 1 1 14 15 1 2 1 2 3 6 1 1 3 1 2 1 2 1 1 10 179 1 2 1 2 3 1 1 2 1 1 9 1 11 1 1 1 3 4 5 6 1 2 1 2 1 13 1 1 3 30 1 1 3 1 2 36 1 2 1 2 1 6 1 1 2 3 1 6 1 2 1 2 3 4 1 1 7 1 9 1 2 3 15 1 2 1 1 32 1 1 1 3 252 1 2 1 1 1 2 3 1 261 1 1 2 1 5 1 2 8 1 1 1 4 1 2 3 1 5 1 1 2 4 1 2 3 1 9 1 1 3 4 1 6 1 1 35 1 2 1 2 3 6 1 1 9 1 1 2 4 1 6 1 1 9 1 2 1 1 2 1 4 6 1 2 29 1 1 1 1 2 4 6 8 1 1 1 4 1 1 2 3 5 1 2 1 2 1 4 12 25 55 1 1 3 4 1 2 1 4 1 65 1 1 3 1 2 1 7 1 1 1 2 3 1 5 1 1 1 3 4 6 1 1 …

Example 3:

Input: 3066 742143634 532204636 705084863 533151204 493755348 912179970 124455319 81503716 711468899 877203894 961144064 39314942 443627128 631799986 341761418 807948970 909028666 320052887 657778137 36831854 875246069 621998968 219966955 865921091 432273380 437539926 182528584 208763567 13857060 240047492 372151405 768339583 143954744 515350837 364598208 629159631 879803826 505241689 495288774 464191860 159629387 132211288 489574552 83750307 160822537 915564715 923027648 66063496 721299389 330499545 644115450 162524343 170835400 103583495 335361502 539405322 446497037 203848571 515731191 651872468 114384422 479402353 880418316 213256741 806823931 67121868 655556744 257059058 740128633 961769754 457577231 720451768 153800324 165744888 124088473 705328076 577864091 478772946 354124484 146406759 91…
Output: 1 1 2 1 1 6 1 1 3 4 11 1 2 3 1 5 6 1 2 1 4 1 1 3 1 2 1 2 1 4 5 8 1 2 1 4 20 1 1 1 1 1 4 1 2 35 36 1 2 1 2 1 2 1 4 5 1 1 3 11 1 2 16 1 2 1 2 1 4 70 1 2 1 2 1 4 1 1 1 1 11 1 1 1 4 1 2 1 1 1 1 2 1 6 1 2 10 1 1 1 1 1 3 6 8 1 10 23 1 1 111 1 2 1 115 1 1 1 1 1 5 1 2 3 1 2 3 1 2 1 7 1 12 1 1 21 1 2 24 1 1 1 1 4 5 6 1 2 1 10 1 1 2 1 5 1 1 8 1 2 1 2 1 25 1 1 2 4 5 1 32 1 34 1 1 2 3 1 2 3 4 1 2 3 4 1 14 1 2 1 2 1 1 2 3 9 1 1 1 2 1 15 1 2 1 4 1 93 1 1 1 3 1 6 1 1 3 1 1 2 1 5 1 1 1 2 1 1 1 4 1 9 10 1 18 22 29 1 1 2 1 4 1 1 37 1 2 1 1 2 4 5 1 2 1 2 1 2 1 4 16 1 1 1 3 58 1 2 3 1 1 2 1 2 3 6 1 2 1 1 3 1 5 14 1 78 1 1 1 4 5 1 2 1 1 5 1 2 1 4 1 1 2 1 5 1 2 1 2 14 1 2 3 1 2 3 1 8 1 2 25 1 2 1 4 1 2 1 4 9 1 1 1 2 5 1 1 2 4 5 1 1 1 3 10 1 1 1 14 1 2 1 2 1 6 1 1 2 68 1 1 3 1 2 3 1 1 1 161 1 2 1 2 1 167 1 262 1…

Constraints:

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

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