CT45191

The Needlepoint Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The assayer Minstrel has been asked to secure the caravan contract. On the desk lies a long table of ledgers readings. 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: 2170 855323855 590393422 349345288 604293896 76457184 649541555 117978306 731853977 93622370 598959460 895703597 7088134 204063044 782802769 378752988 313209139 295073912 419707037 509402166 272399839 316435723 976738800 323042491 893787520 319323394 677626875 682984050 132108302 995938534 295656842 283865253 374393360 91244560 129729194 997684731 185219683 14146598 3178234 765013792 489245944 359914606 885195286 390105795 380988673 390246081 433278758 244141772 615857035 412305249 207106844 260557702 352958720 952672416 638958534 131772791 296780685 244070529 253186956 928077628 207587013 334413398 6413770 54167079 702198394 938786218 415757962 988145661 999144684 674505172 914525147 415964348 362212157 823897012 428527689 18246525 687878676 529952922 536261000 758073419 544746368 7992956…
Output: 1 1 1 3 1 5 1 7 1 2 11 1 2 3 1 1 1 4 5 1 2 22 1 2 1 2 3 1 29 1 1 3 1 2 35 1 1 1 4 1 1 7 1 1 3 4 1 6 1 1 2 3 18 1 1 2 1 2 6 1 2 1 2 5 12 1 32 68 1 2 1 1 3 1 1 3 1 2 6 1 8 1 1 2 15 1 1 1 2 20 1 1 25 1 1 28 1 1 2 1 4 1 7 1 1 3 1 1 6 7 43 1 2 1 1 1 6 1 1 1 4 11 1 2 3 1 1 1 3 1 1 6 11 1 13 1 2 1 17 1 1 1 1 2 1 2 5 1 10 1 1 2 3 4 1 1 3 19 1 21 1 1 1 1 3 1 1 6 1 10 1 2 1 1 5 1 2 1 1 2 1 1 2 4 15 1 2 3 4 1 2 3 1 2 3 85 1 1 1 3 1 1 2 4 5 6 7 1 2 1 2 1 1 3 1 1 10 1 1 2 4 15 1 1 2 4 31 1 1 2 1 2 5 1 2 1 169 1 2 3 1 2 6 1 1 2 4 5 1 1 8 1 2 1 1 5 1 7 1 9 1 1 3 1 1 6 1 1 3 1 34 1 2 3 4 1 1 2 4 9 1 2 1 2 1 1 7 1 18 222 1 1 2 1 1 2 1 2 1 1 7 1 2 1 15 1 1 2 1 1 2 1 1 3 10 1 12 1 1 1 3 1 2 1 2 8 1 2 1 4 14 1 1 2 4 1 20 1 34 1 1 1 2 5 1 1 3 1 2 6 1 1 3 1 50 1 2 1 1 5 1 2 3 9 1 2 1 2 1 6 1 2 1 4 11 12 1 14 1 …

Example 2:

Input: 1847 291021319 437998748 33914554 989940522 108256851 299266581 607927593 692506219 998587291 688135381 42563966 318614638 643184289 608763763 413640630 319699466 537431549 220110059 919818303 699418409 288380015 856276880 851753851 774654367 580538273 918064820 580130602 684114320 292626368 520660875 211698886 572293143 184992623 269795730 16631670 685388922 83217383 263087662 821665821 826319649 32896013 251369364 757421219 840558365 259758298 223320951 689326498 132272820 220071241 795764846 367690808 629707722 446557484 650771789 655864047 232600869 921876123 636948471 792120826 903179486 454206211 631321076 934965488 422071091 265771862 191255276 407829067 802943098 140054579 699217283 494714512 912850187 733482309 461035889 340144314 591617477 841922684 103540965 552920434 74218965 9…
Output: 1 2 1 4 1 2 3 4 9 1 1 2 3 1 1 1 3 1 10 1 1 3 1 1 1 7 1 2 1 2 1 4 1 2 1 10 1 2 13 14 1 2 3 18 1 1 3 1 2 6 1 2 1 4 5 1 48 1 2 3 1 2 54 1 1 1 3 5 1 2 1 9 1 1 1 3 5 1 2 1 72 1 1 2 1 2 5 1 8 1 10 1 1 3 1 2 3 4 1 2 1 1 12 1 1 1 4 1 2 1 2 1 2 1 4 1 1 9 1 11 1 1 3 1 22 23 1 1 2 3 5 1 2 1 9 1 2 1 4 140 1 1 1 4 1 1 1 3 1 10 1 12 1 1 3 4 1 1 1 3 5 1 1 8 1 2 3 4 17 1 2 3 1 2 3 4 1 6 1 1 1 3 5 6 1 2 18 1 2 1 2 1 4 7 1 2 57 1 2 3 1 1 3 1 5 9 1 1 2 4 1 1 3 1 9 1 1 2 13 23 1 1 2 1 4 5 6 1 1 3 1 2 13 1 2 1 4 1 2 3 1 9 1 2 1 4 1 15 52 1 1 3 1 1 2 3 1 1 62 1 1 2 1 4 1 7 1 1 1 11 1 2 1 2 3 6 1 1 3 83 1 2 3 1 88 1 2 1 4 1 1 1 4 1 2 1 1 2 14 1 2 3 1 2 1 7 1 2 1 1 5 1 2 3 1 5 1 2 13 1 1 2 1 2 1 1 1 6 1 2 25 1 1 1 2 1 6 7 1 2 1 2 12 1 2 3 4 5 1 1 20 1 1 2 1 2 1 2 1 4 9 1 1 1 2 5 1 1 1 2 3 5 7 1 14 45 1 2 3 1 2 3 …

Example 3:

Input: 2855 271935889 516302592 678029193 748296076 509002558 971088856 912685182 799972148 388052390 391140807 356158340 661386585 634666534 917810047 915107560 906886088 173902783 570514014 536233739 223974876 567722119 326562049 553242731 399391186 551521515 526316903 486210272 356123934 622253923 647290523 783745559 179416617 278342718 407501874 700076008 246008286 397799402 675298833 837107620 150566217 764135412 865622226 217229045 167283189 624209188 197168260 354049376 650414947 113545884 451930083 596481286 386068212 626913060 177444801 44122510 663939081 200917974 977427832 814817764 707845580 956312373 465367564 29743525 181863075 6580741 732471427 576264886 968711042 834086625 326200250 15925200 767611978 163240183 863253890 39758180 676076217 819552616 653343078 464321319 756139460 4…
Output: 1 2 3 4 1 6 1 1 1 2 1 4 1 8 1 1 1 2 1 1 3 1 2 1 2 1 1 1 13 14 15 1 2 3 4 1 2 3 23 1 2 26 1 1 3 1 2 6 1 2 3 1 5 1 1 14 1 58 1 1 3 1 1 2 1 5 1 10 1 1 1 3 1 6 1 2 3 1 1 3 1 8 1 10 1 2 1 1 2 1 4 1 7 1 9 12 97 1 1 2 4 1 1 1 4 5 6 1 1 2 1 1 1 1 1 9 1 1 3 13 1 2 1 2 5 6 1 1 3 10 24 1 1 2 38 1 137 1 1 1 3 4 1 7 1 1 1 1 3 4 14 1 2 3 18 1 2 3 1 2 1 4 8 1 2 3 1 2 3 1 5 9 1 1 12 1 1 2 1 2 3 7 1 2 3 1 1 2 7 1 16 1 2 3 1 1 1 61 1 2 1 2 1 2 3 6 7 1 1 1 4 5 6 1 1 3 4 1 6 1 2 15 1 1 3 1 2 1 2 1 4 1 1 1 4 11 12 1 2 1 41 1 1 46 1 1 1 1 2 3 1 5 1 1 1 3 12 1 2 1 1 18 1 2 1 4 23 1 2 1 2 5 1 1 1 3 5 1 142 1 1 1 3 4 5 6 1 1 1 3 1 13 1 1 2 1 5 6 7 1 2 1 2 5 1 1 3 1 1 1 3 20 21 1 1 2 3 5 6 1 1 2 10 1 1 1 2 1 5 1 2 1 1 1 6 1 2 25 1 1 1 3 4 6 1 2 1 2 1 2 3 6 1 75 1 2 1 1 3 4 1 1 1 1 2 1 5 6 1 1 92 1 2 3 4 1 1 2 1 1 6…

Constraints:

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

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