CT41010

Last marks of Eklavya

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the port of Emberfall with crates of marks, and Eklavya the dispatch writer must account for every last one. 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: 3295 806594628 233344201 527122493 111383377 653990199 320171465 622712449 20453549 653507267 482940363 779939300 777425881 270273032 540262734 985270809 945586461 300756419 388372083 377247527 410885773 330437281 416998557 910851778 575909738 552483298 347562847 458127632 136464100 64225842 298329562 291344874 443507194 873817536 658336206 140482045 713680139 329889817 522381617 212243965 478179972 46525980 897921577 851576364 324342635 908049192 840223720 887951733 861329154 252048072 561842264 714611167 870020604 377264597 181152091 391376346 947022816 720825209 148414784 210668057 403061131 399991680 821776535 845079079 926144048 300099753 689730699 213769548 531928805 704952653 433801348 408926461 498854894 5074871 557935951 506535367 114240453 613566377 35001264 569491998 458272231 2…
Output: 1 1 2 1 4 1 2 1 4 1 10 1 1 2 15 1 1 2 1 4 1 6 7 1 1 1 2 1 1 3 1 5 10 1 1 3 1 2 1 2 1 19 1 1 22 1 2 1 1 2 3 5 1 1 3 41 1 1 2 3 1 6 7 8 1 2 1 2 5 1 1 3 1 5 1 1 8 1 2 1 1 3 1 2 21 1 1 3 4 1 2 1 1 2 1 2 1 7 1 15 1 1 1 2 1 91 1 1 2 4 1 2 1 8 1 2 3 1 1 2 1 2 1 18 1 1 2 22 1 2 3 4 1 1 3 1 1 10 1 1 1 1 5 1 1 1 3 148 1 2 3 1 1 1 4 8 1 1 2 1 2 3 1 1 1 4 1 1 3 14 1 2 3 1 175 1 1 1 3 1 2 1 1 9 1 1 3 4 1 6 1 1 1 10 1 2 13 1 2 1 1 3 1 5 30 31 1 1 3 1 1 2 3 8 1 1 11 1 2 1 4 5 6 1 8 1 2 1 4 1 1 3 8 1 2 3 1 1 2 1 2 1 1 5 12 21 1 1 2 1 1 6 1 1 9 31 1 33 1 2 3 1 88 264 1 1 3 1 2 3 1 2 6 10 1 1 2 1 4 1 1 7 8 1 10 1 2 1 2 16 1 1 3 1 5 1 1 2 3 4 1 38 1 2 1 1 5 1 2 3 47 1 1 2 1 2 5 1 1 3 9 1 2 1 2 5 6 1 2 1 1 1 6 1 1 9 1 1 2 1 1 2 4 1 8 35 1 1 2 39 1 2 3 1 2 1 4 5 6 1 1 3 1 11 1 2 14 1 1 20 1 2 1 1 1 1 4 8 1 10 …

Example 2:

Input: 412 854713054 698643481 517196025 200258697 197746438 830307197 50560404 470368541 749953801 798332825 716745122 926959105 400297221 715731385 372508789 483697432 800285732 447686305 770560060 585925583 945948918 503862208 546101969 288619399 659582037 382554613 387750969 246854116 884188258 564492842 33118264 262443021 863890721 306865203 801088128 32923167 748612929 563591280 615792699 490806307 923046716 503529454 284646907 581169499 802316028 242191277 909909402 866372454 713270257 798457669 153966786 51027372 462978105 708313153 958442551 792487005 735418945 739519338 178117840 338565647 635581770 252257890 508602022 725341219 909453667 267158150 7632284 748803943 941513922 407058152 781524384 73904700 514415349 823630136 262568272 905642957 462976457 971239846 324575720 602005779 381…
Output: 1 1 1 1 1 5 1 2 3 4 1 12 1 2 1 2 5 1 2 1 21 1 2 1 4 1 2 1 8 1 1 2 4 1 2 1 2 1 2 1 20 1 1 3 4 1 6 1 1 2 1 1 3 4 55 1 1 2 1 2 3 1 2 6 10 1 1 3 14 1 2 1 2 5 1 7 1 78 1 2 1 1 5 1 1 8 1 2 11 1 1 1 2 1 1 5 7 1 1 3 1 102 1 1 1 106 1 2 1 4 1 2 1 1 2 10 1 1 1 1 4 1 6 1 1 2 4 1 2 1 1 3 10 18 1 20 1 2 1 1 3 1 5 1 7 40 1 2 3 1 2 1 1 3 6 1 1 12 1 1 2 1 1 2 6 8 1 2 1 4 1 1 7 1 2 1 2 5 1 1 3 24 1 1 1 3 5 6 1 1 3 1 1 1 3 5 39 1 1 1 2 1 5 46 1 1 2 1 2 1 2 3 1 7 1 1 2 13 1 1 2 1 1 2 4 8 1 2 1 2 3 14 1 16 1 1 1 2 3 4 7 1 1 3 1 5 43 1 2 92 1 1 3 4 1 2 7 1 2 154 1 1 2 1 2 1 7 1 1 2 165 1 2 1 4 1 2 3 4 1 2 3 1 2 10 1 1 17 1 2 1 2 5 1 2 8 26 1 2 1 2 5 1 2 1 4 1 2 1 2 14 1 2 1 1 1 6 1 8 1 2 1 1 1 2 1 2 1 7 11 1 2 1 1 3 4 66 1 1 3 4 1 6 1 1 1 2 3 1 2 1 8 1 2 3 12 1 21 1 1 3 1 1 1 2 1 30 1 1 1 2 1 5 6 1 1 1 3 1 2 3…

Example 3:

Input: 1478 512500279 234949672 367596459 350866112 316358019 464057445 491481326 99290379 332007588 633529523 414111028 992136063 943225683 267262831 103781652 738540470 301853393 148981145 335146715 325362515 969869797 812105611 742092062 550346723 709568170 527670243 188981121 560498914 558093456 940175820 515362025 483497008 969608283 526967937 293366349 333650302 868789209 148806128 101926846 477188699 152040105 236712475 607064666 594258236 694893206 79849708 497253145 211263891 910438141 378315366 968361657 981285454 884363440 284040490 291352641 804749603 184882079 871185558 343197131 854364835 74671032 336985343 926149422 435187980 599984288 757764946 305505991 883495922 184363967 134000112 165095205 173597506 757663884 198297515 645471332 453330711 720717514 105251325 622874021 43671832…
Output: 1 1 2 1 1 5 6 1 2 10 1 12 1 1 1 3 1 1 3 1 9 1 1 1 2 1 1 3 1 9 1 1 12 1 1 2 4 1 1 3 1 2 6 1 8 1 2 1 16 1 18 40 1 1 2 3 1 5 1 2 1 2 11 1 2 3 1 5 1 1 2 3 5 1 2 1 4 1 2 1 4 1 1 2 1 34 1 2 1 1 1 80 1 1 3 1 1 6 1 2 1 1 1 3 4 5 1 1 8 1 1 11 1 2 1 2 17 1 2 1 1 3 6 1 1 9 1 1 3 1 2 6 16 1 1 2 3 5 1 1 49 1 2 1 2 3 1 2 1 2 8 1 1 3 12 1 2 1 4 5 1 19 1 1 2 4 1 2 7 1 2 1 1 31 1 1 2 3 5 1 1 3 1 41 1 2 1 1 2 4 5 1 2 1 2 1 4 1 2 108 1 1 3 1 2 1 4 8 1 1 1 3 1 2 1 2 3 1 2 20 1 1 2 3 1 2 1 2 8 1 10 12 1 2 1 2 3 6 1 2 1 2 3 1 1 2 3 1 1 6 1 32 1 1 3 4 1 2 3 1 9 1 11 1 1 14 1 2 3 1 2 3 1 2 1 2 1 6 1 1 61 1 2 84 1 1 1 1 5 1 2 3 1 2 1 1 1 3 10 1 2 1 1 5 1 106 1 1 2 1 5 1 1 3 1 316 1 2 1 1 2 6 1 1 2 1 2 1 13 14 1 1 2 3 1 6 1 22 1 1 3 4 5 1 1 1 4 1 1 2 4 1 2 1 4 1 41 1 2 1 1 1 6 1 2 1 10 1 1 1 14 1 1 3 1 2 3 1 1 2 1 …

Constraints:

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

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