CT54141

Vigo's Secret Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the ink district of Scriptoria with crates of marks, and Vigo the measurer must account for every last one. 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: 722 998642110 219465067 160637326 193480947 572737669 799243069 143160409 413991814 737522108 849503750 744202063 882150259 157158538 640737386 571414301 962494022 197117226 825095390 851471823 187258958 387194634 127636814 122983436 613401224 430565035 567452274 971210754 873738539 111936637 617304220 737353626 705144624 883871222 927368282 726991818 127605974 529900537 205280820 599921722 491959530 496612045 242306660 223116583 140003841 387903917 780798174 179861577 406436416 627433808 525982319 808430113 840979992 281816299 259904754 159485630 75597923 97678364 251388188 91659753 519747384 781158912 650394533 354669927 848450079 191221433 365720689 438724898 957292861 587025593 998055438 902159946 979127262 705691035 755117775 925763795 525234605 276051048 363117171 485693334 110295997…
Output: 1 1 1 2 4 5 1 2 3 9 1 11 1 2 1 15 1 2 3 1 2 1 1 5 1 2 26 1 1 2 3 1 6 7 1 1 2 1 4 1 2 1 1 1 4 12 1 2 3 1 17 18 1 1 1 1 2 4 1 8 9 1 1 30 1 2 3 41 1 69 1 2 1 2 3 1 1 2 3 1 6 1 8 1 1 2 3 1 2 1 1 1 6 1 2 1 1 14 1 2 1 32 1 1 1 2 1 1 5 1 1 1 43 1 1 3 1 2 1 7 1 2 1 1 2 1 1 1 7 1 2 1 4 12 1 2 3 1 1 2 4 1 1 3 1 1 1 4 15 1 1 2 1 32 1 2 37 1 2 3 4 5 1 2 1 4 1 6 7 13 1 1 3 4 5 1 7 1 1 1 2 12 1 2 1 29 1 1 3 33 1 1 36 1 2 1 77 1 1 3 1 2 6 1 1 9 1 1 96 1 2 1 2 1 6 1 1 3 106 1 1 1 110 1 1 2 227 1 1 3 1 1 2 1 2 1 7 1 1 1 11 1 2 1 2 5 6 7 1 2 1 1 2 6 1 8 1 1 3 30 1 2 1 4 1 2 3 4 1 1 44 1 46 1 2 1 2 1 2 3 1 1 1 2 5 1 2 8 1 2 1 17 1 1 1 2 1 6 1 1 3 1 11 1 78 1 2 3 1 1 3 1 2 9 1 2 3 1 5 15 1 2 3 1 1 2 4 8 1 10 1 1 1 2 3 5 1 7 1 10 1 1 13 1 2 1 2 1 4 1 2 7 1 34 50 1 1 53 1 1 1 4 1 1 2 1 1 1 1 8 1 10 1 2 1 14 1 1…

Example 2:

Input: 1424 259330314 786507548 984843469 806536842 708277594 804772486 683306924 670049215 476805939 431405267 215006584 803168105 994154305 24218060 817357318 804287988 57072333 775442595 213292426 707733587 78766003 24599903 575518806 832489067 625337353 104598881 871977250 976281376 206715735 452131136 82731047 614313206 199161129 673650913 985018902 391967197 502081290 597728012 354796068 427803089 265376259 840676795 235048827 659524856 858646134 897725844 258338329 756443173 272320537 694371760 899874626 161210550 116312639 2387071 181368057 729404350 140346156 213075300 756391642 171802601 692642288 921954501 836293577 926721413 927385133 131975364 281946757 582624321 831599409 843902586 531441026 260173783 766494307 132403726 816034815 213529668 323540813 655373922 530713753 440645364 45…
Output: 1 2 3 1 1 2 1 1 1 1 1 6 13 1 2 1 1 2 1 2 1 1 3 11 1 1 14 15 1 2 1 4 1 6 22 1 2 3 1 2 1 7 1 2 10 11 1 2 1 2 16 1 1 1 4 5 1 2 8 1 2 27 1 29 30 1 2 3 4 5 1 1 3 1 5 1 2 3 1 1 2 1 8 1 2 1 4 1 14 1 1 27 1 1 1 4 1 1 1 3 1 102 1 1 2 3 5 1 1 1 4 5 1 1 3 1 10 1 2 3 4 1 1 2 1 9 1 1 12 1 1 3 1 1 6 1 2 3 4 1 24 1 1 3 1 2 1 1 1 2 1 5 1 2 3 1 16 51 1 1 2 1 5 1 2 1 2 1 2 5 1 14 1 16 17 1 2 1 1 5 1 1 1 3 4 1 6 7 14 1 2 3 1 2 1 38 1 2 1 2 1 2 1 8 1 1 3 1 1 210 1 2 3 4 5 1 1 1 1 1 5 1 1 9 1 2 1 1 1 1 2 3 4 19 1 1 2 3 1 2 3 27 1 1 1 4 1 1 2 4 1 2 1 1 3 1 2 3 13 18 51 1 1 3 1 5 1 2 8 1 2 3 4 13 1 1 2 4 1 2 7 1 1 2 1 4 1 2 15 1 2 3 1 2 1 35 1 1 1 2 1 2 6 8 44 1 2 1 4 1 2 7 1 1 3 55 1 1 1 2 1 1 1 3 1 2 10 1 13 1 1 2 3 1 19 1 2 22 1 1 2 3 4 1 7 1 86 1 2 3 1 5 1 2 1 2 3 1 2 8 1 1 3 4 1 1 7 1 2 10 1 1 1 3 114 1 2 1…

Example 3:

Input: 1108 149862726 222653805 185023253 80093882 562794606 420100587 919748863 478613515 211315674 730517980 975481468 233169613 451587467 350737019 857421899 588665725 271928791 678858689 998373101 937088260 60887142 105420058 520200742 319428683 979357219 172777572 859682085 34690320 55010919 279203474 550614270 443378693 385297591 955767690 639201377 8487234 564286775 982655729 699822178 271630642 826784398 250511900 471022168 716292933 223796369 55447104 270334662 614820697 859829047 257841316 491812685 300337833 489359231 435040727 822998281 883511048 26525934 385965459 213876034 423201729 836059773 393604849 195861782 73634341 210592865 661830759 806486002 549935279 215503531 677186749 964650113 932032701 746200755 654452058 904526145 415674898 162249605 910092645 296952095 650163452 6855…
Output: 1 2 1 1 5 1 7 1 1 3 11 1 2 1 4 1 1 3 19 1 1 2 3 1 6 1 2 1 2 3 4 1 1 9 1 1 2 19 1 1 3 1 2 3 1 1 3 4 11 1 2 1 2 1 6 18 1 2 1 4 5 1 1 1 3 5 6 1 1 3 33 1 1 1 3 1 1 6 1 2 3 1 2 3 1 2 9 16 1 2 1 2 1 4 1 8 1 1 1 1 13 1 1 3 1 2 1 2 38 1 2 1 1 2 6 1 79 1 2 3 1 2 1 105 1 2 1 1 3 1 1 1 4 5 1 1 8 9 1 1 15 1 1 1 4 1 1 3 1 9 1 1 2 3 1 6 1 2 3 1 5 36 1 2 3 1 1 1 1 5 1 2 1 2 1 1 15 1 2 1 2 3 1 2 23 1 1 1 2 3 6 1 1 1 10 11 35 1 2 3 1 2 1 42 1 2 1 2 1 6 1 2 1 1 5 1 1 8 9 10 1 2 1 4 15 102 1 1 3 1 2 1 1 110 1 1 3 1 5 6 1 242 1 1 1 4 1 1 1 3 1 5 1 1 3 4 1 2 3 8 15 1 1 3 1 2 1 1 23 1 2 3 1 2 1 7 1 2 33 1 1 2 3 1 5 1 2 3 1 1 12 1 2 15 1 2 1 2 5 6 1 56 1 2 1 4 5 6 1 8 1 1 3 1 2 1 7 1 1 10 1 1 3 22 23 1 1 2 4 1 2 1 87 1 1 3 4 1 1 3 1 1 3 11 1 13 1 1 3 104 1 1 2 4 1 1 1 2 1 10 1 1 1 3 1 2 3 1 5 1 2 22 1 2 3 1 1 3 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.