CT43700

Warden and the Mossy registers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Warden runs the brewery at the archive halls of Scrollkeep. Today the books show a list of registers, and the numbers must be worked out before sundown. 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: 267 905491325 413494869 721303632 830803709 374474507 644177245 400453442 672023716 976182152 50560278 612125939 726700971 534827374 949053607 145891468 780637846 202975753 794401841 336444396 696975997 617110686 366746705 875119724 610945521 4603467 234372276 298598795 490781788 407028927 944235834 730764518 242537111 123719909 91307607 681985129 985806137 671462428 863329923 119520594 260385397 135127206 805798693 634098741 191489292 815945511 587507795 622715097 876373419 593555102 669935605 816575570 230669418 938554066 942476869 945843595 630632114 701671487 75763321 954946687 391202770 740185339 975990525 650876335 450331120 803014842 211660868 592378747 276304073 100694759 474252217 792187966 149472805 362694173 272040859 1987653 184078002 496804020 507709585 784891568 310439179 278…
Output: 1 1 2 3 1 2 1 4 9 1 2 3 1 5 1 2 1 4 1 2 1 1 9 1 1 2 3 4 1 16 1 1 1 1 4 36 1 2 1 2 1 4 1 1 7 1 2 12 1 2 3 1 17 18 19 1 2 1 23 1 2 26 1 1 3 1 2 1 1 3 6 1 2 1 1 2 6 7 8 1 1 3 4 1 1 3 1 1 2 11 1 30 1 32 1 2 61 1 1 1 1 3 1 5 6 9 1 11 1 2 1 1 3 1 2 3 4 5 1 2 3 4 1 1 7 29 1 1 3 4 1 1 1 37 1 39 1 2 1 4 1 1 3 47 1 1 1 2 4 1 6 1 8 57 1 1 2 158 1 1 1 2 3 6 1 1 9 1 11 1 1 3 1 16 1 2 1 4 1 6 1 2 1 4 1 1 2 1 15 1 1 2 3 4 1 2 8 1 1 42 1 1 3 4 1 2 3 1 2 1 7 1 1 1 2 16 1 2 1 4 1 2 3 8 1 26 1 1 3 1 2 32 1 2 1 1 5 1 2 1 4 1 2 1 4 5 1 16 1 1 19 1 1 3 1 2 6 1 27 1 29 1 2 1 4 5 1

Example 2:

Input: 1602 568002357 970990353 559338573 253830752 579707646 133881342 457688424 283857191 889896733 707292853 772289730 303283472 709200670 320225391 156718485 313942785 621259993 168111061 985335626 82581411 972790884 596197439 22136819 431569480 148092173 614231814 855329802 817677672 197311281 803941677 710183927 130572608 881030629 859193607 340125222 915820102 653962916 870934843 982337415 898040354 234063515 131468154 80262282 546267833 740405605 871839149 176323341 68007710 274095545 210804136 908010269 806359915 570474536 444647981 920149912 605449693 880082162 9582425 643745646 443145459 442519432 941521566 24656119 693111533 245228960 419168124 753377098 615123956 337311456 81567299 378525468 404888229 173765477 685134829 786253675 772561495 137602724 816284765 890086608 970731865 439…
Output: 1 2 1 1 3 1 2 1 7 1 2 1 2 1 1 2 4 1 19 1 2 1 1 2 1 5 6 1 1 2 1 1 12 1 1 15 1 2 20 1 1 1 1 4 5 6 1 1 3 1 12 1 1 1 16 1 2 1 2 1 1 23 1 2 1 2 5 1 1 1 3 4 1 7 13 1 1 16 17 41 1 82 1 2 1 2 1 2 5 1 1 2 1 5 6 1 2 3 1 1 2 3 5 1 2 3 1 1 1 2 5 28 1 1 2 32 1 1 1 4 1 6 1 2 1 1 2 1 47 1 1 2 4 1 2 1 1 5 1 2 1 2 1 6 1 17 1 2 1 4 1 1 2 3 5 1 1 2 9 1 1 1 2 14 1 16 21 1 1 1 1 5 44 174 1 2 1 1 3 1 2 6 1 10 1 1 3 1 5 1 1 1 3 1 1 2 1 1 2 4 1 1 9 1 2 1 1 5 6 1 1 1 2 5 6 26 33 1 35 1 1 2 3 1 2 1 1 3 1 5 12 1 1 1 1 4 5 1 8 1 2 3 24 1 1 2 1 2 1 4 7 8 1 1 2 3 73 1 1 2 3 4 6 7 1 1 83 1 2 1 1 1 6 1 1 9 1 94 1 1 3 4 1 2 1 4 1 6 11 116 1 2 3 1 2 3 4 1 1 2 1 2 3 4 7 13 1 1 1 3 1 5 1 7 1 1 1 2 1 14 1 1 2 1 5 6 1 1 3 1 1 1 7 14 15 1 1 1 2 4 1 2 1 1 55 1 1 1 1 4 1 2 3 1 2 6 1 1 2 1 5 6 1 1 2 21 77 1 1 1 1 1 4 6 1 1 3 1 2 1…

Example 3:

Input: 3412 404577717 311012437 24509520 737951275 389292177 295818279 339258122 683740894 656422579 232722359 363912785 823250852 283150619 611879948 356394200 241262505 614481284 707514162 961392393 53758154 385809727 413426098 895109761 821438227 832030803 453425416 463220014 710392338 806983183 570842401 332007958 872546775 842353492 183466895 951942831 637671911 627496531 486274552 12665942 334484990 329980963 704878979 302739140 998781325 395643643 462507516 683382420 127904814 630504877 631080245 716355087 814733823 386862977 32166645 177156665 575956906 163799682 930659430 795875098 928239495 298527689 841339309 756360071 662373191 925458799 665290505 725893468 545052488 438305174 889743938 18143027 605879808 990114351 531302658 713305379 672546962 936739282 697855377 200862775 141499856 …
Output: 1 1 1 4 1 1 2 4 1 1 2 12 1 2 1 1 5 6 19 1 2 3 4 1 2 1 2 3 4 1 1 9 1 1 16 1 1 1 1 2 1 7 1 44 1 2 3 1 2 3 7 8 1 1 2 4 1 14 1 2 1 2 1 1 5 1 2 1 1 5 1 2 29 1 2 1 4 1 1 1 3 4 1 6 1 2 1 1 11 17 1 1 3 1 2 3 4 8 26 1 1 2 3 1 6 1 8 1 2 1 2 5 1 2 1 9 1 19 1 1 1 2 3 6 1 2 1 4 1 2 7 8 1 2 1 2 1 1 95 1 1 3 1 1 3 1 2 1 2 5 1 1 8 1 13 1 2 1 2 3 6 1 1 2 1 1 3 1 2 1 2 5 129 1 2 1 1 5 1 2 3 9 10 1 1 13 1 1 2 1 1 1 7 1 9 1 11 12 1 1 2 4 5 1 1 2 4 1 1 12 1 2 27 1 2 3 1 1 2 3 5 9 1 1 2 3 5 1 56 1 1 1 2 3 1 7 1 1 3 1 1 2 7 1 2 10 18 1 2 1 2 3 1 5 1 1 1 4 1 1 12 1 16 1 2 1 4 21 22 1 2 1 4 1 2 7 1 9 10 1 2 1 2 3 6 1 2 9 1 2 1 13 1 2 3 1 2 3 7 1 9 1 2 1 1 2 1 39 1 1 2 1 4 5 1 2 48 1 2 1 2 1 2 1 1 2 3 5 8 1 2 1 2 3 16 1 1 2 1 2 3 1 1 9 1 2 1 2 1 2 1 1 34 1 1 2 1 5 1 41 1 2 1 1 3 1 2 1 4 1 1 1 2 9 1 2 60 1 1 2 4 1 2…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Warden and the Mossy registers - MEDIUM Coding Problem | CodeTikki