CT56498

Ulric's Silent Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the lantern reef of Glowtide, Ulric studies rows of marks entries. One clean number will settle the guild's oldest argument. 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: 1834 739570392 309567158 268583546 750167520 874105738 123951403 425158663 567303694 678005405 292284946 806865400 618577370 704398047 914531643 808450993 756318780 702384139 511150004 674874717 486811871 477597132 182797220 23459849 53130310 899068522 356551835 729324103 851071208 139143986 903098112 914274238 493200785 157555754 377246376 741939355 52258871 889327130 410829981 325626373 229964045 957299184 609041653 670437173 145751872 933954770 555695496 982664605 273227068 289858129 532233951 457537459 648018052 584759354 67659765 792193752 827111360 611201746 606524367 35701496 867749652 678898104 150585459 915837708 7892380 910520983 630714710 816886178 862374876 981939586 927185057 861343893 515370831 237493055 952074873 51769183 268172129 633757913 826290838 570048533 757652533 179…
Output: 1 1 1 4 5 1 2 3 4 1 6 1 2 14 1 1 1 1 2 1 1 1 1 2 11 1 2 3 1 16 17 1 1 2 4 1 6 1 1 1 41 1 2 1 4 1 47 1 2 3 1 5 1 1 8 9 1 1 1 13 1 1 16 1 2 1 2 3 22 1 1 1 1 5 1 2 3 4 1 2 1 2 3 4 1 6 1 14 1 1 1 2 3 6 21 1 2 1 1 3 1 7 1 2 1 1 5 1 1 3 1 2 113 1 2 3 1 2 3 4 121 1 2 3 1 2 1 4 1 1 3 8 12 1 2 15 1 1 3 1 1 2 1 2 1 2 1 2 1 2 9 1 2 3 15 1 18 1 2 1 4 5 1 2 8 9 1 1 3 1 50 1 2 3 1 1 6 1 2 1 2 1 12 1 2 3 1 2 1 7 1 2 3 1 2 1 4 15 1 2 1 4 1 6 1 1 3 1 2 12 40 1 1 1 4 1 2 1 1 3 4 1 8 1 1 11 1 2 1 4 1 6 1 1 1 2 3 1 5 8 9 1 2 73 1 246 1 1 2 1 5 1 1 3 4 1 1 12 1 2 1 1 5 1 2 8 1 1 3 4 5 1 2 1 4 1 1 2 1 1 1 4 7 38 1 2 3 1 1 3 4 8 1 1 3 12 1 2 3 4 1 1 19 1 2 1 1 2 6 1 2 1 2 5 1 1 2 1 2 1 6 1 8 78 1 1 1 1 3 1 7 1 1 2 1 1 5 1 1 9 10 1 12 13 1 1 3 1 1 6 7 1 1 3 4 1 2 1 15 1 1 2 3 1 1 2 1 2 6 1 2 12 1 1 1 52 1 2 3 1 5…

Example 2:

Input: 3434 138297180 845751789 573155222 419303899 478450683 664634957 643887690 924255499 226640303 696380942 453587934 417670448 997812649 866998470 773935001 216053296 359564588 150506759 389150944 594425160 639712832 255986434 27891410 737259050 540606807 780951472 135124734 473483237 991272805 393712787 874300464 798573232 836126635 860522744 93412426 685500925 247935309 850056417 615278132 653021993 514773159 150189886 460551649 159327348 987639069 898761348 58918996 519011472 422412105 500333624 560781662 78283925 940556448 241087770 589965705 492572742 732628668 119376666 215506860 539401610 77850429 55307885 352622383 350595684 770904634 678728441 16189748 345235191 583680199 56983739 239357749 417758847 805070461 578096739 795961214 83774733 893645573 245150007 36204960 185752754 14593…
Output: 1 2 1 1 2 4 1 8 1 2 1 1 13 1 1 1 2 1 4 5 6 1 1 9 1 12 1 2 16 1 2 1 2 3 1 2 1 4 1 2 1 1 2 1 16 1 1 2 1 2 5 1 8 1 2 1 4 1 2 3 1 1 3 1 12 1 1 2 3 1 2 3 20 1 2 1 24 1 1 2 1 37 1 2 1 4 1 1 2 4 1 1 1 3 1 2 1 4 1 2 19 1 2 1 4 1 2 1 4 1 6 1 8 13 1 15 1 2 1 1 3 1 7 1 2 1 2 1 2 3 4 7 1 1 2 1 2 3 7 39 1 2 1 2 1 2 1 2 3 1 106 1 1 3 1 2 1 2 8 1 1 3 1 2 1 15 1 1 2 1 2 1 4 7 1 1 1 12 1 1 2 1 5 1 1 1 174 1 2 3 1 5 1 1 1 2 1 6 1 2 3 1 1 17 1 2 1 1 5 1 2 8 1 2 3 1 2 218 1 1 3 1 1 1 2 3 1 1 6 1 8 1 2 1 4 15 1 2 1 1 3 6 1 2 3 1 2 3 13 1 2 3 1 1 1 7 21 1 1 3 43 1 1 3 1 1 3 1 1 6 1 1 3 10 1 2 1 1 2 1 7 1 1 3 1 68 1 1 2 3 5 74 1 1 2 3 1 1 1 2 3 6 1 1 87 1 1 2 4 5 1 1 3 1 5 1 2 1 2 10 1 1 1 1 1 4 17 1 19 1 2 3 4 1 2 1 1 2 1 2 1 9 1 34 1 1 1 2 1 6 7 1 9 1 1 1 1 4 49 1 56 1 1 3 1 1 2 1 1 5 1 2 3 1 1 3 4 5 1 1 3 1 1…

Example 3:

Input: 1530 752138400 860949070 851656403 139288769 811872331 196061772 509295497 254344566 957497002 975538094 959622391 722406739 550157616 237940310 410673722 180451747 316032706 649364700 849143275 685704023 684772546 190205 460162223 722746047 518322774 213670323 412205310 720661390 161085899 547828990 377027824 141291527 849068765 806067450 244775545 636138418 817204364 641033365 473994863 69684070 687293296 757873008 151903763 981859506 369918753 883855928 929271674 610923533 451980751 322423288 11400418 670644744 420343167 624610364 695936249 589152240 76403780 574372160 142938990 728869015 155175560 683212753 919794236 32059208 758600646 280542729 655190525 640664898 861403256 153206068 782670292 428397273 998051953 476199111 238679877 421519406 75940232 170026083 728823719 903788814 142…
Output: 1 2 1 1 2 1 2 1 9 10 1 1 1 1 2 1 2 6 8 1 1 1 2 5 1 1 2 4 1 2 1 1 14 1 1 2 4 1 1 1 4 5 1 44 1 2 3 1 1 1 1 5 1 2 8 1 1 2 1 13 1 2 16 1 2 1 2 1 6 1 2 1 73 1 1 2 1 2 6 7 1 2 3 1 12 13 1 1 1 4 1 1 2 4 1 1 1 3 4 1 15 16 1 1 2 3 4 1 23 1 1 1 1 41 1 2 1 2 5 6 1 1 2 1 2 1 1 3 8 9 10 132 1 1 3 1 1 1 1 4 1 6 1 2 10 1 2 1 4 1 2 3 1 1 1 4 1 1 14 1 1 3 4 5 1 1 2 1 1 38 1 2 1 2 1 1 1 6 1 1 2 12 1 2 1 4 5 1 2 3 1 2 1 4 8 9 1 1 2 1 69 1 1 3 1 2 1 2 5 1 2 1 2 1 4 15 1 2 3 4 1 1 1 2 5 1 1 1 2 1 1 7 1 2 1 2 1 22 1 2 1 1 2 4 1 1 1 2 1 4 1 6 1 8 1 40 1 1 2 3 1 1 2 4 1 9 1 1 3 1 15 1 2 1 74 1 1 2 1 2 3 1 5 1 2 11 1 2 1 1 1 91 1 1 2 3 4 5 1 2 1 4 1 1 12 13 1 2 1 4 1 1 1 3 1 1 6 1 1 3 4 5 1 18 1 2 1 1 3 129 1 2 1 1 2 6 1 8 1 1 1 1 2 1 2 5 1 18 1 20 1 1 2 1 2 6 1 2 1 1 3 6 7 1 2 1 4 1 13 1 1 2 1 4 6 1 1 2 1 1 1 26 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Ulric's Silent Ledger - MEDIUM Coding Problem | CodeTikki