CT52095

Lamplighter's Ledger of marks

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

It is audit day at the spice bazaar of Saffronia. Lamplighter spreads the marks records across the table and picks up a sharp pencil. 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: 1979 402823043 987635588 766725654 805807922 555464667 214097715 74544448 728742945 328904372 108065 823070530 91870391 653889239 786313915 851649470 237557768 927463968 852322777 642508193 211514651 935693873 399796999 558406826 781067587 475342223 405592788 538957508 678985458 20193772 385508512 770972558 523568205 229940043 465240606 103709535 941390803 911450637 57574915 533987540 284594042 201376776 971917466 861904121 724614170 674831545 143229993 878598344 362559789 179271008 779158436 827063963 137242627 978409922 897486338 547187265 980407684 307131163 721481075 284070417 970427008 62017025 333635677 576013670 419615903 390526208 637862766 787396758 991950696 501424498 647971449 937526662 191764422 523530261 413700193 301655342 738570921 306763164 658509985 621491757 749520410 533…
Output: 1 2 1 2 1 1 1 4 1 1 9 1 2 3 13 1 15 1 1 1 19 1 2 3 1 1 3 4 1 2 7 1 1 2 1 34 1 1 2 1 1 40 1 1 1 1 5 1 1 3 4 1 51 1 1 54 1 2 1 4 1 2 3 1 1 6 7 68 1 2 3 1 2 1 1 5 1 2 1 9 1 1 3 1 14 1 2 1 1 22 1 2 1 4 1 1 1 3 1 10 1 1 1 3 1 2 3 1 1 1 21 1 1 2 1 5 6 1 29 1 1 2 3 5 1 2 1 4 1 2 3 1 1 2 11 1 1 19 1 1 2 1 2 3 4 1 9 1 2 1 2 1 2 1 4 1 6 1 1 1 4 72 1 2 1 2 3 4 1 8 9 1 1 2 4 1 1 2 1 4 1 7 1 1 1 1 12 1 18 1 2 1 2 5 1 128 1 2 1 4 5 1 1 1 3 4 1 7 8 1 1 2 4 1 2 1 2 1 1 3 1 26 1 2 3 1 2 6 7 34 1 1 1 4 5 1 2 238 1 1 1 1 4 5 7 1 2 1 2 1 6 1 2 3 1 2 1 7 1 1 1 2 1 1 3 7 1 1 1 4 26 34 1 2 3 1 2 1 4 8 1 2 3 1 5 1 7 1 2 1 2 1 4 1 2 3 1 26 1 1 3 1 2 1 4 1 2 1 1 3 10 1 12 1 1 15 1 20 1 1 3 1 1 3 1 2 1 4 1 12 1 1 2 1 1 3 1 7 41 1 1 2 3 1 2 6 1 8 10 11 1 54 1 2 1 4 1 1 1 1 4 1 1 2 13 1 1 2 3 5 1 1 8 9 10 1 1 3 14 1 2…

Example 2:

Input: 3858 510612708 827712798 829305114 614240313 324010214 696750464 905312012 522601142 667302366 943990611 558964415 212387011 919737153 130350909 300004537 870228192 43705278 284354936 51681991 704604395 511137470 720361651 640160451 583836155 200064417 85726016 499408466 554315977 108564075 552644024 131455081 335849704 115827223 334092568 574050166 810413391 20926192 570787888 540130809 730411619 790019839 232424199 780562450 680356158 746319491 249074114 531348989 961779910 36516115 522756338 418872898 128376755 219582304 154146135 508988193 448261845 241474167 680015745 264334308 677917360 189007007 652228232 354350043 354664883 205507343 792915826 72632977 900195438 821309292 59803184 516869490 392928887 660307622 812466157 256752193 499080622 492371017 527046161 77478178 709583180 955…
Output: 1 2 3 1 1 3 7 1 2 10 1 1 3 1 2 3 1 2 1 4 1 6 1 1 1 1 3 4 1 2 1 2 1 2 11 20 1 2 1 4 5 1 2 1 2 1 2 48 1 2 1 1 2 1 5 1 1 10 1 2 1 2 1 2 1 18 1 20 1 1 2 1 4 5 1 2 1 4 1 6 33 1 2 1 1 3 4 1 2 90 1 2 1 4 5 1 2 1 4 1 6 7 13 1 1 3 1 1 19 1 1 2 1 5 1 26 1 2 3 4 121 1 1 3 1 1 6 1 1 3 10 1 1 1 1 1 1 4 1 8 1 2 1 1 3 14 26 1 28 1 2 3 1 1 3 7 1 2 1 1 5 1 1 3 4 1 11 47 1 1 3 4 1 1 1 8 9 1 1 1 4 5 6 63 1 1 3 1 1 3 1 2 1 2 5 6 7 11 1 79 1 2 1 2 1 2 1 1 1 89 1 1 2 3 4 6 7 1 1 2 11 1 1 3 4 1 1 228 1 1 1 1 2 6 235 1 2 1 1 3 1 2 1 9 1 1 1 248 1 2 1 2 1 6 1 2 9 10 1 12 1 1 2 1 1 5 7 8 1 2 1 24 1 2 1 28 1 1 3 4 5 6 7 1 2 1 2 1 2 3 1 2 1 9 19 1 1 1 3 5 1 7 55 1 2 1 1 5 1 1 3 9 1 2 1 1 5 1 1 8 9 1 11 1 2 1 1 1 3 1 5 1 8 1 1 13 1 15 1 1 3 1 1 3 1 34 1 2 3 1 1 2 1 4 1 6 54 1 1 2 1 1 3 7 1 1 3 1 1 3 1 1 9 1 127 1 1 3 …

Example 3:

Input: 3983 456434909 894298844 121791184 34130964 217402822 697273101 497012826 706334170 26951954 457255804 376886357 931840377 805843344 604187879 368590294 867024405 109210629 861921517 752818738 209995076 443169332 519768731 490816344 741500941 604055162 743665605 438507084 485260000 354395634 269818095 344119646 671725429 816025764 967613014 441969790 22538041 770399534 465026081 669780606 3190477 84081951 923453786 225400812 105096962 80668923 400263289 156612934 659476004 636516459 602208059 288308021 328346811 885583922 332063563 105281194 929792270 668786028 719015623 203568683 192702955 76144639 941094693 395335482 651094867 770495116 435974700 121455996 525616986 224902282 452051306 924299630 76094577 863359130 547614052 939209828 507914975 90948648 907061385 645794595 569810795 83640…
Output: 1 2 1 1 3 4 1 6 1 2 1 12 1 1 1 4 1 2 1 1 2 3 1 5 1 7 1 2 1 1 2 6 15 34 1 1 3 1 2 1 2 8 1 1 1 4 1 6 1 1 1 2 11 1 1 22 1 2 1 1 1 28 1 2 3 1 1 3 1 2 9 1 2 1 13 1 1 3 1 1 3 1 2 3 1 2 3 13 1 1 2 3 4 6 1 1 2 23 65 1 1 2 1 4 1 6 1 8 1 1 111 1 2 1 1 1 3 1 2 3 1 1 12 1 2 1 4 1 1 3 1 2 1 1 1 2 1 4 1 7 11 1 1 1 1 5 24 1 2 1 1 1 4 1 2 3 1 9 36 1 2 1 1 2 6 1 2 1 2 1 1 13 1 2 1 1 1 6 7 21 70 1 1 1 4 5 6 1 2 1 1 2 6 1 2 9 1 1 2 200 1 2 1 4 1 1 7 1 1 3 4 1 2 1 4 1 1 3 4 1 2 1 2 1 18 1 2 3 4 1 1 2 1 1 1 2 8 1 1 1 3 1 14 1 2 3 1 1 1 3 26 1 2 1 1 1 2 3 1 1 10 1 1 3 1 2 3 4 1 1 1 3 5 1 2 1 16 1 18 1 2 1 22 1 1 3 4 1 1 3 1 5 1 11 12 1 1 1 1 17 1 2 3 1 1 2 4 1 2 10 1 1 62 1 2 1 2 1 4 1 6 1 1 3 10 1 1 128 1 1 1 3 1 2 335 1 1 3 4 1 2 7 1 2 3 1 1 3 1 2 6 10 1 1 13 1 2 3 4 1 6 7 1 2 1 2 1 2 7 1 1 2 1 1 40 1 2 1 2 5…

Constraints:

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

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