CT46203

Last ledgers of Jeweler

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

It is audit day at the lakeside town of Mirrormere. Jeweler spreads the ledgers 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: 2773 141103065 531590095 415996478 570088360 320812474 953596038 343394745 642662988 860778364 60775272 504802889 694641212 609010410 717131941 609112366 955189014 571018298 465185248 720226643 978039058 16809534 904735230 344732478 773622692 425330190 226753410 455579573 33884219 245311033 980780211 393545271 768064438 398561524 408447692 994200463 608647810 509771591 425021599 114240382 561142423 620013529 929505987 617867692 949920336 568669256 973927233 559335296 878019402 732794405 941838889 703171070 762932323 367041125 176477237 27779410 421400139 267055437 837721260 738049626 871789219 17672214 454257665 657459656 582081922 950157838 653176684 212231640 624878126 978407985 933143408 132126811 529588175 109626204 739874861 935984806 948564620 449498610 124305335 71516745 900795368 9…
Output: 1 2 1 4 1 6 1 2 3 1 2 3 1 5 1 16 1 1 3 20 1 2 1 2 1 1 3 1 2 30 1 2 1 2 35 1 1 1 1 4 6 7 1 9 1 11 1 2 1 4 1 2 1 1 1 4 1 8 1 10 1 2 3 1 19 1 1 2 34 1 1 2 1 4 6 7 1 1 1 4 5 1 1 2 3 5 1 7 1 1 1 4 1 59 1 2 3 1 1 2 4 5 1 1 1 1 1 2 1 16 1 1 3 1 21 1 2 3 1 2 6 1 2 1 1 1 3 1 129 1 2 3 1 2 6 7 1 2 1 1 1 2 4 8 1 1 2 3 4 1 1 1 1 2 4 1 2 1 15 1 2 1 1 1 3 7 1 1 2 4 5 28 1 2 1 4 1 6 1 36 1 1 2 4 1 1 1 1 53 1 2 1 2 1 4 1 2 1 1 2 4 1 12 1 2 1 4 1 1 2 1 5 1 1 3 27 1 1 1 3 1 6 1 1 1 2 38 1 2 1 4 1 2 3 1 1 2 4 1 2 1 2 1 6 1 1 13 1 2 1 1 5 6 1 1 3 1 1 3 1 1 3 1 5 6 1 40 1 2 1 1 3 4 1 1 7 1 1 1 4 14 1 56 1 2 1 1 3 1 2 1 1 8 1 2 69 1 2 1 1 1 6 1 8 1 117 1 1 1 1 5 1 7 1 1 3 1 5 1 2 3 1 5 6 1 2 3 22 1 2 1 4 5 1 2 3 1 5 1 2 1 9 1 2 39 1 2 1 2 1 2 1 1 3 6 9 1 2 1 1 1 2 7 1 2 60 1 1 2 1 5 6 1 2 1 2 1 1 13 1 1 76 1 1 …

Example 2:

Input: 3820 384402194 820764650 187068241 868236992 579732523 537451260 765009479 689812244 883304804 502849465 24902232 318363564 968325328 201722772 683157270 380088299 771490431 433926717 217427892 121855250 654744219 801152237 626858025 629361735 714165002 768651346 176727129 254627762 464412150 301785563 524380072 563381908 412359833 545800925 996017116 176036668 983449961 542885522 131708796 666985022 393783715 659490811 487017466 538109383 759884643 663826931 208611995 203015149 337736770 368460075 981221020 651547755 617792651 245218999 924645730 540503155 363913989 174688245 904157991 181627856 214441746 635936742 100304989 570862687 771151219 73219133 204141870 474901439 165357785 897518196 148059395 253904590 31942421 50797845 183284744 58293362 814428686 17575147 845350482 894046300 7…
Output: 1 2 1 4 1 1 3 1 9 1 1 2 13 1 2 1 4 1 1 1 4 9 1 2 3 4 1 2 3 1 5 6 1 2 35 1 2 1 1 3 1 2 1 2 8 1 1 1 3 4 14 1 1 1 4 1 1 1 4 1 2 3 1 2 6 1 2 3 1 11 1 2 1 2 3 1 7 1 9 10 1 1 1 1 1 3 6 1 1 3 1 1 2 13 1 1 3 47 1 65 1 1 1 2 4 1 6 1 2 1 1 12 1 1 1 4 1 6 1 1 3 1 1 2 3 4 1 7 29 1 1 2 1 2 5 6 1 2 3 1 2 3 1 2 45 1 47 48 1 2 3 1 1 6 1 1 3 1 1 3 1 62 1 2 3 4 5 1 2 1 4 1 2 7 1 2 177 1 2 1 2 1 1 5 1 2 8 1 1 1 14 1 1 3 1 1 1 4 1 23 1 2 1 1 2 1 2 6 9 1 2 3 1 1 1 2 4 1 6 1 1 1 4 5 25 1 1 2 4 1 2 3 1 5 35 1 1 3 1 5 6 1 8 1 2 3 1 48 1 2 3 4 1 2 1 2 1 1 2 60 1 1 1 2 3 5 1 2 1 1 1 2 1 14 1 2 3 4 1 6 1 2 1 2 1 2 1 2 7 30 1 1 1 3 1 1 120 1 2 1 2 1 2 1 8 9 1 2 3 1 1 6 16 1 1 2 3 1 1 2 1 1 10 1 2 3 1 151 1 2 1 1 5 6 1 1 2 1 5 1 2 14 1 1 3 4 1 2 7 1 9 1 1 1 4 1 6 1 8 1 2 1 1 3 1 1 3 7 1 1 3 4 1 6 1 2 3 4 28 1 53 1 2 1…

Example 3:

Input: 1048 402885702 197786566 88121654 88197374 343314503 91747756 45859611 387829148 152907238 271611265 503864054 788177554 316297746 168337901 147795398 663120779 460811170 937500803 338369196 954120683 963934417 6191757 168335001 489603152 260607261 963269699 541595057 262982303 459934711 814998913 77944070 802611934 209184569 136122433 256722193 204466705 838828409 685298464 54115868 944352911 692293003 34691270 776742238 838327281 991348506 684745754 473746844 391703054 978814434 500876023 733819170 232648652 103525129 729673080 553962551 797523997 786112054 399837932 219795808 434734256 882813612 705721063 332382996 456838342 737838948 361103881 270356677 318706037 495481392 684671705 922382048 472976389 857032986 907555814 799546490 635943642 872165901 438580893 30236301 70909740 875369…
Output: 1 1 1 2 4 1 1 7 1 2 11 12 1 1 1 4 1 18 1 20 21 1 2 3 1 5 1 1 2 4 1 2 1 1 3 1 11 1 1 14 1 1 3 4 45 1 1 1 4 1 2 1 1 3 1 7 1 1 1 3 12 1 1 2 4 1 1 2 4 5 22 1 2 3 1 1 3 1 1 2 7 1 2 1 2 5 1 1 2 1 5 6 1 1 2 3 1 1 1 2 8 1 2 1 2 57 1 1 2 3 1 6 1 8 1 2 3 1 1 1 1 2 1 1 1 1 3 1 23 1 82 1 2 1 2 5 1 2 90 1 2 3 1 1 2 4 1 9 1 1 2 3 1 1 1 3 1 2 7 1 9 1 2 1 2 18 1 2 1 1 5 24 1 129 1 2 1 1 5 6 1 1 2 3 5 1 7 1 2 10 1 1 3 1 2 6 1 1 3 1 2 3 7 1 1 10 1 1 2 4 1 22 1 2 3 4 5 1 2 1 2 1 6 50 1 1 3 1 1 1 2 1 2 10 1 2 3 64 1 2 3 1 243 1 2 3 1 2 1 2 1 1 1 1 1 5 1 10 1 17 1 1 2 1 2 1 1 1 2 7 1 1 2 1 4 15 16 1 1 1 4 1 1 2 3 9 1 1 1 2 291 1 2 1 1 3 1 2 3 4 1 9 1 13 1 2 3 1 2 3 7 8 1 1 11 1 1 3 4 5 1 1 1 33 1 326 1 2 1 2 1 2 7 1 2 1 4 1 1 7 1 2 3 1 1 3 1 2 6 1 25 1 1 1 4 1 1 3 1 2 1 2 1 4 1 6 16 1 18 1 1 3 4 1 2 7 1 27 1 2…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Last ledgers of Jeweler - MEDIUM Coding Problem | CodeTikki