CT51361

Ysolde's Granite Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

In the heron rookery of Longlegs, Ysolde the assayer keeps careful count of the ledgers. Reorganize the archive shelves, every figure matters. 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: 1963 369073230 300844696 90247797 325626706 486225192 717544540 149497937 912145447 378484970 682870759 943957848 99629134 95450891 929591742 137168788 888515129 155268481 815580587 473841488 168462882 921686117 162837595 474739300 57538124 963775296 834239007 621950514 94382281 654792550 30055412 959011871 653253586 322023552 312799047 787495660 261560799 183529219 825149516 353317978 722400832 28833055 468302893 694050389 306085728 510058909 45110966 195103225 49157881 406462715 895190471 900411436 911501734 24191319 680530426 425922002 48503504 900417144 624091845 93131000 897526434 725030664 860469877 279436813 886541018 808190357 830004276 148869326 938599551 618411314 757637856 389326969 487155911 8517724 296780612 84814916 130503511 822550921 545300762 688618834 312767050 678794368 …
Output: 1 1 1 3 5 6 1 8 1 2 11 1 1 3 1 2 1 2 1 1 7 1 2 1 25 1 1 1 3 1 6 1 1 1 4 1 1 7 1 2 1 2 3 1 2 1 2 1 4 19 20 21 1 2 1 1 5 1 1 3 1 2 1 4 1 2 1 37 1 2 1 2 1 2 1 2 9 1 2 1 2 1 2 16 1 2 1 1 21 1 1 3 1 94 1 1 1 2 4 1 2 8 1 2 3 1 5 1 2 1 2 1 2 5 1 2 15 1 2 1 1 2 3 5 23 1 25 1 1 3 1 2 3 4 5 1 2 3 4 1 2 7 8 1 15 1 2 3 4 1 2 1 2 3 10 11 1 2 1 15 1 1 3 4 1 2 1 1 3 6 1 8 9 1 11 1 2 1 49 1 1 2 1 1 2 1 2 3 6 1 11 1 1 3 1 1 2 1 20 1 1 1 3 1 5 7 1 1 2 31 1 2 3 1 1 2 7 8 1 1 1 3 5 1 7 1 1 3 1 5 1 14 1 2 3 1 1 2 3 1 6 1 1 2 13 1 1 38 1 2 1 2 159 1 2 1 4 5 6 1 1 9 1 1 2 1 4 1 2 1 18 1 1 3 1 2 1 4 1 6 1 2 1 1 1 4 16 1 2 1 2 1 2 1 2 3 1 2 10 1 12 1 2 15 1 1 1 3 1 1 1 4 1 9 10 1 2 3 1 2 17 1 1 2 3 1 6 1 1 1 78 1 2 1 4 5 1 1 3 4 5 1 90 1 1 1 3 1 6 1 1 99 1 2 3 1 2 3 1 8 1 2 1 4 1 2 3 1 2 1 1 3 4 7 1 1 2 14 1 16 1 …

Example 2:

Input: 956 136491001 829500697 548742407 923122065 156642335 846220941 753580520 859135346 309584514 180503932 731730606 140853100 961151073 471353781 794408908 681830073 668998721 932576194 647856518 490693590 687245882 750082223 784455486 944137495 225266741 451493494 121394800 351473724 499634748 725480831 330429808 644280527 84324424 282239794 763278225 375385377 828081673 804028509 975453798 378536039 424993243 129346726 308519644 338964999 757419143 574303825 873980066 672589887 123086963 811953190 881043607 77604641 527187497 878472000 277826525 187249224 180235141 985085029 781449507 84478684 562481951 316524276 537927345 643059619 640357916 674941573 530256315 116619416 23116971 643759246 911111889 308918020 17632640 479081557 888695731 665210191 294161485 407289578 951798665 320108826 9…
Output: 1 2 1 4 1 2 1 4 1 1 3 1 13 1 2 1 1 5 1 1 3 4 5 11 1 2 1 2 5 6 1 2 1 2 11 1 13 1 39 1 2 1 2 3 6 1 8 1 1 3 12 1 2 3 1 1 1 58 1 1 2 1 2 5 1 7 1 1 1 4 13 1 1 3 4 1 1 2 21 1 23 1 2 1 2 1 1 1 8 1 1 3 12 1 2 1 4 1 1 3 8 9 103 1 2 3 1 1 3 7 1 1 3 1 2 3 4 1 1 3 1 9 1 2 1 126 1 1 1 1 5 1 2 3 1 2 1 4 5 1 15 1 2 1 2 3 6 1 1 9 1 2 1 2 5 1 16 1 1 2 1 2 37 1 2 1 1 3 1 7 1 2 1 2 5 1 14 1 2 1 2 5 1 1 2 1 1 3 7 1 1 1 3 4 13 1 2 1 2 3 1 2 21 1 1 2 1 2 27 1 1 1 3 1 5 1 1 55 1 1 1 4 1 1 1 8 1 2 1 2 3 1 2 6 1 10 1 1 2 14 1 1 1 4 5 1 1 1 2 3 1 7 1 1 2 1 1 1 1 5 35 1 1 3 47 1 1 2 1 1 6 1 1 2 10 1 2 13 1 1 1 4 1 2 1 4 1 2 1 12 128 1 2 1 1 1 3 5 1 2 3 4 1 6 12 1 2 1 1 2 1 1 22 1 1 2 4 5 1 2 8 1 2 3 4 1 2 1 2 5 1 7 1 2 14 1 1 1 1 2 3 21 1 2 3 1 1 2 1 8 1 1 40 1 1 2 1 1 6 1 2 49 1 1 2 1 1 55 1 1 3 1 1 1 7 8 1 1 3 1 1…

Example 3:

Input: 687 219042274 738671348 659224457 632213891 418341984 524337749 981740521 771773106 836447696 78597171 949933225 407066248 53432945 722405634 471348731 688745482 948662810 352481821 34673914 35903750 594298034 653026637 237465899 219890007 78666559 517036510 95219693 170093717 588321839 194087483 297681063 39250213 195910738 633141020 390356140 464338536 711143523 876933924 859093072 534193726 763466434 58901552 163808953 864502136 327060267 587531583 269891806 172065943 881965377 399713987 90699394 827870496 693061066 750502856 780635443 173335906 721210376 190646397 917411177 686796806 951558019 538689777 362528026 259206945 233613298 914977137 544900993 712944782 351004382 421404759 647535176 341426448 39518372 787443228 512241835 749891014 985225635 234884762 686111046 691526095 134660…
Output: 1 2 1 1 1 2 7 1 2 1 4 1 1 3 1 2 6 1 1 2 4 5 1 1 1 4 1 2 7 1 2 1 2 12 1 2 20 21 1 1 2 1 2 6 1 2 1 1 32 1 1 3 1 2 3 1 2 1 42 1 54 1 1 1 1 5 1 2 1 2 3 1 1 8 1 2 77 1 2 3 1 2 6 1 2 1 87 1 1 1 2 5 6 1 2 3 1 2 3 1 1 2 10 1 12 1 14 15 1 1 2 4 1 2 28 1 30 1 1 2 4 5 1 1 3 1 10 1 2 3 4 5 16 1 2 49 50 1 139 1 1 3 1 2 6 1 1 3 1 2 1 1 1 4 10 1 18 1 2 1 2 1 2 5 1 27 1 1 2 4 1 1 3 4 1 2 1 8 1 2 1 16 1 1 3 1 2 1 2 1 9 53 1 2 3 1 2 6 1 2 201 1 2 3 1 2 6 1 2 3 1 1 6 1 1 9 1 2 12 1 2 1 4 23 1 1 2 1 1 6 1 8 32 1 1 2 4 1 6 1 8 1 2 1 1 3 1 2 3 1 1 2 4 1 1 15 1 1 3 1 1 262 1 2 1 4 1 1 3 1 5 1 1 1 4 5 1 1 2 1 4 11 1 1 3 20 1 1 1 2 4 1 1 3 4 1 10 1 37 1 2 1 1 1 3 1 8 1 1 2 1 5 1 1 1 3 1 1 2 4 1 1 1 2 5 6 1 2 3 1 11 1 2 1 2 3 1 1 1 1 2 1 7 28 1 1 3 1 5 1 2 1 2 55 1 2 1 4 1 2 1 2 101 1 1 3 4 1 2 7 1 1 2 3 5 1 1 2 3 …

Constraints:

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

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