CT53828

Vigo and the Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the singing sands of Echo Dunes with crates of marks, and Vigo the cartographer 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: 1927 441534693 461402022 623282207 873157626 316968245 366622612 636699137 900263001 464673029 588982363 345318962 473636982 57095132 194002103 667425856 525026001 504494464 742467622 570055957 653725256 552520521 839394432 294640431 172857193 663718027 396549010 888852228 885368239 684685832 229142256 162828310 546519930 31789659 83929442 253590196 115688675 881479653 285132274 535655333 83181151 531073918 661290 163038045 230108926 397457117 657078911 459201144 968314912 818009963 20880787 979496651 170767482 381084291 156772335 391890169 108409895 579549392 583340643 289320707 380097984 121045418 881237053 107295961 870659127 653195631 288635773 873208691 977090938 590086449 794800111 513143687 21599548 257087568 301523205 775189112 112117923 39094664 783038477 141009819 343035618 30347…
Output: 1 2 3 4 1 2 3 8 1 2 1 2 1 2 7 1 1 10 1 2 1 14 1 1 3 1 19 1 1 1 1 3 1 2 3 1 9 1 2 1 2 1 2 3 4 9 1 48 1 1 51 1 2 1 4 1 6 7 1 2 1 11 1 2 1 1 5 17 1 2 1 1 2 3 5 1 1 8 1 2 1 4 1 1 2 1 4 20 1 2 1 4 1 2 1 2 1 1 3 4 13 1 2 16 37 1 2 3 1 2 1 2 5 1 1 11 1 2 1 2 1 1 2 4 1 2 1 2 1 2 13 1 2 1 2 3 137 1 1 3 1 5 1 2 3 1 1 6 1 2 1 15 1 2 1 1 1 2 1 8 1 1 1 4 1 1 3 1 1 1 3 12 13 1 15 1 2 18 1 2 3 1 5 1 1 3 1 1 2 3 31 1 2 1 2 196 1 198 1 1 3 4 1 2 7 1 1 1 1 1 2 4 1 1 9 1 2 1 2 1 16 1 2 1 1 1 6 1 2 3 1 1 6 1 8 1 2 1 1 13 36 1 2 1 4 1 2 1 1 1 2 5 1 2 3 1 2 13 1 15 1 2 3 4 5 1 7 27 1 1 1 1 2 1 70 1 1 2 3 4 1 2 8 1 2 1 82 1 1 1 1 3 4 6 1 1 9 11 1 1 1 4 1 1 2 3 1 2 104 1 1 312 1 1 1 3 1 1 3 4 1 9 1 1 3 1 2 3 1 1 3 7 1 2 1 4 12 16 1 2 3 4 5 1 2 1 2 1 11 38 1 1 2 1 1 2 3 8 1 1 1 1 2 5 6 1 2 1 1 12 1 2 1 16 1 2 3 4 …

Example 2:

Input: 938 7398532 322951599 953038489 730384533 99181501 690511313 29513328 430515140 937834189 63082904 799835334 312677263 912091850 591183102 216988989 120016445 674311552 183544004 391919099 158403115 514138372 767498623 781607066 318756710 397197841 412201144 100160201 344725253 405258198 106225125 961205474 402950606 863371955 445372211 765757680 71763841 263733109 985396215 860592155 58613867 37797481 861577634 972710216 868655416 997056174 562117958 942244486 39829238 130968218 73437644 622249564 555182803 423000376 173286546 939405749 434751653 59697732 24347694 960252955 370457574 479348996 535133805 335227674 457865231 620532491 351654941 304957945 420852319 3665798 414485856 597502935 120355514 359229110 460958034 3435398 759714782 897656799 710780775 367471880 241654656 888165725 98…
Output: 1 2 3 1 1 2 1 2 6 1 2 1 4 1 1 1 4 1 2 1 4 9 10 1 2 3 1 2 3 1 31 1 2 1 2 1 2 38 1 1 1 4 5 1 45 1 2 1 2 1 4 1 1 1 8 1 1 1 14 1 2 3 1 2 6 1 1 3 1 2 6 1 2 3 1 17 18 1 1 1 4 1 2 1 4 1 6 7 1 1 3 11 1 1 1 4 5 1 2 8 1 2 3 1 2 1 2 1 6 1 2 12 68 1 2 1 2 1 6 1 1 3 1 5 1 13 1 1 3 1 86 1 1 1 3 5 1 1 2 4 10 1 2 1 1 1 4 1 2 3 1 1 6 1 2 1 10 1 2 29 1 1 1 4 5 1 1 1 4 1 40 1 2 3 1 2 1 2 1 1 1 1 3 1 1 1 7 1 15 1 1 2 1 1 3 1 5 1 2 1 4 1 13 1 2 1 4 5 6 20 1 2 3 1 2 1 1 3 1 10 1 12 1 2 35 1 2 183 1 2 1 2 1 6 1 8 1 1 3 12 1 1 3 1 1 3 4 5 1 2 8 1 2 1 1 1 4 1 1 3 8 1 23 1 1 2 1 4 1 2 3 1 10 1 2 3 14 1 1 1 2 5 1 1 1 1 4 5 1 2 8 29 1 2 1 1 2 4 7 1 1 10 1 2 1 2 3 1 2 1 2 5 1 2 1 4 5 1 1 3 1 20 1 2 3 1 1 6 1 2 3 1 41 1 2 1 4 1 1 1 2 5 10 1 12 118 1 2 1 2 1 1 2 1 2 8 1 1 2 12 1 1 3 1 2 6 1 1 2 3 1 6 1 14 1 30 1 2 3 4 5…

Example 3:

Input: 439 188069656 186349945 599600225 974123797 353704543 900491995 181135178 375565100 982253706 70136611 294138305 232133443 981551947 22679007 358118717 356609554 147757605 446752472 822327158 691701555 340700709 59742166 283001448 843774524 890267302 402617475 914292747 766563055 759270504 185376443 797311659 304858727 236340812 620046346 784776644 606997590 672599060 924485393 437806252 220186829 437909127 71104225 904412123 673481324 756787510 190368844 971886047 713812881 149410759 499914885 553102760 826590902 213485105 486005808 524139305 682738315 645154098 708658465 341510230 988883673 431138130 673539133 515386449 910419942 945999615 502666336 458073115 170150252 964591237 786294652 666673978 668746443 289001600 608637035 261915131 471256831 675766940 655952478 371767712 57933066 4…
Output: 1 1 3 4 1 2 1 2 9 1 2 1 4 1 2 1 1 5 6 1 1 1 2 11 12 1 14 1 1 1 4 1 1 3 4 1 2 25 1 1 3 1 5 1 2 1 34 1 1 2 3 5 1 2 3 4 1 6 1 60 1 2 1 4 5 1 1 1 9 1 1 2 1 2 1 2 7 1 1 1 3 1 1 6 16 1 1 2 1 4 1 2 1 9 35 1 2 3 1 2 1 2 5 1 1 106 1 2 1 1 1 1 7 1 2 1 1 1 2 1 4 1 1 3 19 1 2 3 4 1 2 1 2 1 2 1 1 32 1 1 2 1 1 5 1 2 3 1 1 2 12 1 2 3 1 1 1 4 8 1 23 1 2 3 1 5 1 2 1 1 3 1 1 2 1 4 1 10 1 2 1 2 45 1 1 3 1 2 6 1 8 1 1 2 1 5 1 15 1 94 1 2 1 98 1 1 3 1 1 1 7 1 9 1 2 3 1 2 3 7 1 2 3 4 1 2 1 2 3 1 11 1 2 14 1 1 2 1 4 5 1 2 9 1 2 1 13 1 2 1 2 1 6 1 8 1 1 1 1 2 41 1 2 1 52 1 2 1 2 1 4 1 1 7 1 63 64 1 1 3 4 5 1 7 1 2 10 1 1 2 14 1 1 2 3 1 84 1 2 3 1 2 1 7 8 1 2 1 2 1 14 1 2 3 1 5 6 1 1 3 1 1 3 4 1 1 3 1 2 1 11 1 1 1 24 1 2 1 2 43 1 2 1 2 3 6 1 1 2 4 1 1 1 1 9 1 2 1 2 5 148 1 2 1 1 1 2 7 1 2 10 1 1 2 1 4 1 1 2 19 1 1…

Constraints:

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

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