CT47463

Smoky registers Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the honey farms of Buzzwell opens only for a perfect tally of registers. Nyssa means to find out. 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: 3312 347946512 309361872 727140060 800846127 463120909 713145691 495575090 462311832 127238887 217196543 799134966 326371576 862076002 143427421 905600074 216230455 207369239 890721521 128906156 178204279 768596938 190969901 196295553 164533041 717285977 329075808 859592513 879189220 376063197 742291465 107300731 874942700 1857540 69901386 417153292 560291061 463939015 766073752 765207152 833506583 401443986 71143913 471093290 126472019 849891426 712140979 549087016 562517029 318696062 361127334 586889062 266921389 601018460 711998228 10984092 676381193 264263897 350318258 204288258 289471240 460721527 129352278 268611092 807463796 580000482 984603316 369945417 169048270 357186352 59794534 841295324 384159046 194222411 441451357 781158853 86252755 732112979 508423088 939656805 946033860 71…
Output: 1 1 3 4 1 2 1 1 1 2 7 1 13 1 15 1 1 3 1 2 3 1 2 1 4 1 9 10 1 2 1 4 1 2 3 4 1 6 1 8 1 1 3 1 13 1 1 2 1 2 5 1 7 8 1 2 1 2 1 2 5 1 2 19 1 66 1 1 2 1 5 1 1 3 4 1 2 1 13 14 1 1 2 4 1 2 1 4 1 10 1 1 2 3 1 16 1 1 2 1 2 102 1 2 3 1 5 1 1 8 9 10 1 1 1 4 1 1 2 1 1 1 3 1 8 1 1 3 1 1 3 4 1 32 1 2 1 1 1 38 1 1 1 4 1 1 7 1 1 1 3 1 2 3 1 1 1 3 1 6 1 1 9 1 2 1 65 1 1 3 1 1 2 174 1 2 3 178 1 1 1 2 4 1 2 3 4 1 2 1 2 13 1 1 17 1 1 1 21 1 1 1 4 5 1 1 3 1 1 6 1 1 2 4 1 6 1 1 2 1 5 1 2 1 4 1 2 12 51 1 1 3 1 2 1 58 1 1 3 1 1 3 7 1 1 3 4 1 6 1 1 3 1 18 1 1 2 1 1 6 1 2 1 2 5 1 2 1 9 10 17 1 2 1 2 98 1 1 3 1 1 2 1 5 1 1 3 1 2 1 2 1 1 3 19 1 2 1 2 5 1 2 1 4 1 11 1 2 1 4 16 1 2 1 2 1 41 1 2 1 1 1 6 1 1 3 4 5 12 1 2 1 2 1 4 19 1 1 3 1 1 3 1 1 2 10 1 1 3 1 2 16 1 1 3 1 2 1 2 5 1 2 1 2 1 6 1 1 33 1 2 3 1 2 3 1 8 1 1 11 …

Example 2:

Input: 1133 670007942 924424117 198247759 863294695 582679038 646360312 442107702 338783107 134672919 614005266 247729606 848661555 288871665 534195957 850498836 235962195 768961106 999408780 975867140 426548198 671873636 485182331 788107388 863943121 738136588 854175981 830447347 367014464 119605119 534398542 869343452 340393021 737206300 136904330 199521899 652025201 52567409 456098297 419717595 417198383 184772608 378419791 307812558 999176192 649521159 564602996 462742111 201869310 904660889 553170440 842507642 332296906 764364 785212044 673693316 363587795 176340631 147348882 404627177 439941641 467263635 711616462 721898498 444561541 943321542 558290620 269613657 656526355 73235516 59567683 131137774 612420478 789221917 813421443 84205950 658529009 887605235 875343712 253123836 261469615 80…
Output: 1 2 1 2 1 2 1 1 1 4 1 8 1 2 11 1 2 18 1 1 2 1 4 5 1 2 1 1 1 3 12 1 2 1 2 3 1 2 1 1 1 2 1 26 1 1 1 1 5 1 2 1 1 3 1 1 1 1 4 5 6 8 9 1 21 1 1 3 1 1 3 4 8 9 1 2 12 1 1 2 1 17 1 40 1 2 3 4 1 1 3 1 1 3 4 1 1 10 11 1 1 1 3 5 1 1 1 4 10 26 1 1 2 3 1 1 33 1 1 3 1 2 3 1 1 2 1 11 1 2 1 2 1 50 1 2 1 4 1 6 1 1 9 1 2 1 1 3 1 1 3 1 5 20 21 1 23 114 1 2 1 4 1 1 2 1 2 1 1 1 2 14 1 2 3 18 1 2 1 4 23 1 1 3 1 28 1 1 2 4 1 2 1 4 1 1 7 1 1 2 1 5 1 1 1 9 1 1 1 2 4 5 1 1 2 1 10 1 61 1 2 3 1 1 6 1 1 1 10 1 1 1 1 1 5 1 1 2 9 1 1 1 4 1 6 1 18 1 1 2 1 4 5 1 8 37 1 2 1 2 5 1 7 1 2 1 1 3 1 2 1 2 1 4 1 8 21 1 1 3 1 1 2 28 1 1 1 3 1 5 1 2 3 9 1 1 1 14 1 1 3 4 1 2 1 4 23 1 2 3 4 1 6 1 1 2 1 5 1 1 1 9 16 1 1 42 1 1 1 3 1 2 7 1 1 1 4 12 1 1 3 4 5 18 1 90 1 2 1 2 5 1 7 8 1 1 3 1 2 1 4 16 1 2 1 1 5 6 1 1 1 3 1 2 13 1 2 1 1 2 …

Example 3:

Input: 1530 409908067 935153393 880450247 592266211 514683755 848063319 374298822 933800189 495202124 142468409 101522736 987471224 587264120 610437507 308233373 906883673 909278519 893416663 356133648 955913552 332412966 824666472 395122100 901908312 506922507 334213394 255965598 93017864 594386670 193859914 631278612 640219602 413257268 681984550 815946181 297290890 654350494 521393156 897736981 960943992 518525640 154637491 368523363 414551814 451178969 6578298 533995563 42976840 29527808 316931046 607682079 722086452 916743292 630003010 992684415 692213685 195682822 860593301 58599200 533040288 938085472 354869129 766401871 455334289 216728596 377283958 5707298 430373610 606606293 404795193 898009021 917891993 67057626 3255195 868375141 101795424 623088858 950028011 943362234 401324905 266162…
Output: 1 2 1 1 1 3 1 6 1 1 1 12 1 2 1 4 5 1 1 8 1 2 1 4 1 1 1 1 5 1 7 8 1 10 11 1 2 1 15 28 1 1 2 3 4 1 7 1 1 3 11 12 13 1 55 1 1 3 1 2 6 1 2 1 1 2 1 4 6 1 10 11 1 1 3 1 2 23 1 1 1 3 1 1 6 7 1 33 1 1 1 1 5 1 2 1 4 1 1 2 1 1 1 1 2 13 1 2 3 17 1 2 1 1 5 1 1 25 1 1 3 1 5 1 2 3 1 5 1 2 1 2 1 6 1 2 1 1 2 1 2 1 7 56 1 2 3 4 1 2 3 1 153 1 1 1 1 2 4 6 1 1 2 1 2 3 1 1 2 3 4 11 1 14 1 1 3 4 1 1 3 1 5 1 1 3 1 5 1 2 38 1 1 2 3 4 5 1 1 8 1 2 3 1 13 1 1 1 2 18 1 1 2 3 1 2 1 1 3 1 5 1 2 3 4 12 1 1 15 1 1 2 80 1 2 1 1 5 1 2 3 1 5 11 1 2 94 1 2 1 2 1 6 7 1 2 1 4 5 6 1 2 3 1 2 3 1 1 6 16 17 1 2 1 4 22 1 2 1 2 1 2 3 4 9 1 2 3 1 14 1 1 2 141 1 2 1 1 3 4 7 302 1 2 1 4 1 6 7 1 1 3 4 1 2 1 1 3 1 5 1 2 14 1 1 3 1 1 6 1 1 1 1 2 1 7 1 1 2 17 32 1 34 1 1 3 1 1 3 1 5 1 44 1 53 1 1 3 4 1 2 1 2 1 2 1 2 1 2 1 2 70 1 2 3 4 1 2 …

Constraints:

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

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