CT50078

The Crimson registers of Tomas

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

In the forest village of Briarthorn, Tomas the archivist keeps careful count of the registers. Prove the quality of the harvest, 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: 2300 62086060 597755350 592444742 633673682 82699544 186212448 210136865 413682913 360271214 421908150 755791787 110582156 278065259 427360477 257792903 968716874 129686322 92547991 582602815 771840844 628547530 657723418 577993441 668535947 753440608 946410918 30246626 728648581 387624605 508325133 944696326 12823749 468225179 138353930 202328653 444661653 175434990 498108722 322144689 31457579 53533380 301188136 997873078 535920106 155718146 456880363 793863312 487730579 498808842 428603306 904565318 649141203 36714052 42404621 933354639 17521714 716967339 88433220 317878409 565850872 935908888 568946365 366007671 784734628 307224270 673020195 643408105 321769471 876107752 935171862 682527275 741233625 680589093 818559326 573840884 903791000 550304263 732200297 152526255 971269660 508932…
Output: 1 2 1 4 1 2 3 4 1 6 11 1 2 3 1 16 1 1 3 4 1 2 1 4 5 10 1 2 1 2 5 1 2 1 2 3 1 7 1 1 2 3 43 1 1 2 4 1 2 1 8 1 1 2 12 1 2 1 2 3 18 1 1 3 1 2 1 1 8 9 1 2 1 4 1 6 1 2 1 37 1 2 1 4 1 1 3 1 2 6 7 1 1 3 1 5 1 2 1 1 3 6 19 24 1 1 3 4 1 1 1 2 3 5 1 1 9 1 2 1 2 3 1 2 1 18 23 1 49 1 2 1 1 5 1 1 3 1 2 1 1 3 4 7 1 9 10 1 2 1 4 1 6 1 21 22 1 1 1 3 1 2 1 2 36 1 2 3 89 1 1 3 4 1 2 1 1 9 1 2 3 1 2 6 1 1 18 1 1 3 1 5 1 2 3 1 2 1 2 31 1 2 1 1 1 1 4 1 40 1 2 3 1 5 1 1 8 1 1 11 1 2 1 1 5 146 1 1 1 4 1 6 7 1 1 2 4 1 2 3 15 1 1 2 4 1 6 1 2 3 1 1 3 1 5 1 1 1 3 1 2 21 1 2 3 4 1 6 1 2 3 1 2 1 4 5 1 2 3 9 1 1 2 22 1 1 1 3 1 2 1 1 9 1 2 1 2 1 1 1 4 40 260 1 2 3 1 5 6 1 2 1 10 1 1 3 1 1 1 3 5 1 1 8 1 1 3 1 5 1 2 16 1 2 3 1 1 1 3 8 1 1 2 1 5 1 7 348 1 2 3 1 1 3 1 2 9 1 1 1 3 1 1 2 1 2 1 11 1 1 2 3 5 1 2 1 2 1 1 2 1 9 1 …

Example 2:

Input: 3016 867987325 802495233 909755143 479129432 979770395 776691793 227098417 274108379 924176297 234502024 936754459 132734275 10441566 804187715 591039910 43778047 611839804 827239999 576447228 525193996 530068351 882809574 352066175 312074684 268765024 409119702 243679821 771205432 139048173 777800048 619361757 296521081 760570713 310522006 915958555 814512430 760555054 250013886 367769501 223396307 584132581 592425731 745815008 705813019 505481851 284158898 902002378 197147569 437208487 358513324 912959658 817530389 693135379 807810275 928696081 634114850 807437830 614505530 412378456 573172553 967267531 258875859 437901998 306737645 277778347 349377442 66871812 700086527 269692463 373334314 865070819 215395688 356497724 859156125 288095630 202146643 54997793 516909307 738652671 387718462…
Output: 1 1 3 1 5 1 1 2 4 1 6 1 1 3 1 1 3 7 1 1 2 11 1 1 1 4 1 6 1 8 1 1 3 1 24 1 1 1 2 1 4 5 6 1 1 1 12 1 2 1 16 1 1 2 44 1 2 1 1 2 56 1 2 1 1 3 1 7 1 2 10 1 2 3 1 1 1 4 5 1 7 1 22 1 1 2 1 5 1 1 1 1 2 1 6 1 1 1 4 1 1 7 1 1 3 1 1 19 1 2 1 1 3 26 54 1 1 2 1 4 1 2 1 4 1 1 1 67 1 1 2 4 1 2 1 4 1 1 1 2 1 6 1 1 1 14 1 16 1 2 1 4 1 2 1 24 1 26 98 1 2 3 4 1 6 1 8 9 1 2 1 1 1 1 7 8 1 2 3 1 5 6 15 1 1 1 1 2 5 6 1 187 1 2 1 1 5 1 2 3 1 5 1 2 1 1 5 1 1 2 19 1 2 1 1 2 6 1 2 1 4 5 1 1 8 15 1 2 1 1 3 1 7 1 24 1 2 3 1 2 1 2 1 33 1 2 1 4 249 1 2 1 2 3 4 1 8 9 1 1 261 1 1 1 1 3 1 2 1 4 9 1 1 2 1 4 1 2 3 1 10 1 1 1 4 25 1 1 3 4 1 6 1 1 1 4 5 6 1 2 1 4 1 18 1 1 3 1 1 1 7 1 2 1 1 1 317 1 1 1 2 1 4 1 6 1 10 1 2 1 2 1 16 1 2 19 1 1 1 2 3 6 1 2 3 4 1 1 2 1 5 1 1 3 4 1 2 1 4 5 1 2 1 2 5 15 1 2 1 53 1 2 1 2 3 6 1 1 2 1 2 …

Example 3:

Input: 545 825809722 288984246 80979753 846176406 590983737 207606361 779645157 49607548 103269092 832746603 704658184 673950428 894229339 483685616 189888560 378909108 730609126 378511706 757437179 674349918 696590757 919336553 482579625 965408038 925765243 405031160 283568705 466736169 701731680 261149087 901456437 978571214 631234162 143817186 908198738 32894289 113061272 273155993 428431567 211637204 526234762 763776866 786394885 810404162 155750768 785117463 686493530 679275004 858991778 859928317 648238013 387966933 465846459 113741577 667923369 684234331 836051642 105089795 837046503 653257794 718669661 159759139 904698367 842716322 917491981 75158739 733493906 947777828 972100863 866481527 866472736 286338364 645673236 568013550 54210791 556480613 407686142 331374213 500473947 651121393 3…
Output: 1 1 1 4 1 1 3 1 2 6 1 1 13 1 1 2 4 1 6 1 2 22 1 24 1 1 1 3 4 1 6 32 1 1 3 1 2 3 4 1 6 7 8 9 1 2 1 1 14 15 1 1 2 1 5 6 7 1 9 1 2 1 28 1 33 1 2 36 37 1 1 1 2 1 1 2 1 1 3 9 1 2 14 1 2 1 1 2 3 7 1 1 1 11 1 1 1 4 5 1 1 1 4 1 6 1 2 3 1 2 111 1 2 1 2 1 2 3 4 1 6 11 1 1 3 4 1 6 1 1 1 4 1 1 2 1 9 1 1 2 1 1 21 1 2 3 4 5 38 1 2 3 42 1 2 1 2 3 4 1 1 1 4 9 1 2 3 4 1 2 1 4 1 6 64 1 1 2 1 4 1 2 1 9 10 1 2 3 4 1 6 1 2 1 4 1 1 13 1 1 1 2 3 6 7 1 2 1 2 3 1 5 1 16 30 1 2 218 1 2 1 2 3 6 1 1 2 10 1 2 3 4 1 2 3 1 9 1 1 1 3 1 2 1 27 1 2 3 1 1 6 1 2 3 1 1 1 2 4 15 1 17 1 1 1 1 4 23 1 2 1 2 1 2 1 6 9 1 11 1 1 1 3 1 1 18 19 1 1 2 46 1 1 1 4 1 2 7 1 2 10 11 1 1 3 4 1 2 3 1 20 1 2 3 1 1 26 1 2 1 2 3 4 1 1 7 1 2 1 2 12 1 2 3 1 2 20 1 2 1 1 5 1 2 28 1 2 103 1 2 3 4 1 1 7 1 1 3 1 1 2 1 5 9 1 2 1 2 1 1 5 24 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.