CT36647

Maya's Ledger of registers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The auditor Maya has been asked to document the rare sighting. On the desk lies a long table of registers readings. 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: 54 135520309 374881402 90078484 431080320 589878934 728625987 495304467 406042701 239790470 468070053 469580827 618933971 990521752 825205247 607776653 726767189 63486214 867683434 409401495 468968930 610197200 157242259 412678543 71321528 903663499 451747541 481063029 794136115 905132516 807193990 540692954 745322206 640819634 740173377 374545431 243618924 382838859 503640951 784169713 498131398 33429370 269797756 975130019 74173805 461255272 180880734 343461138 422383187 903932264 145389950 921604056 110756441 798399905 200075043
Output: 1 2 1 4 5 6 1 1 1 3 4 6 13 1 1 2 1 5 1 2 3 1 2 1 12 1 2 3 16 1 1 2 1 2 1 1 3 4 9 1 1 2 30 1 2 1 2 3 6 1 8 1 2 1

Example 2:

Input: 3532 555717994 319794962 628815849 50940256 171883847 445604158 506153791 201373811 188013215 112125110 155120349 126974537 195098231 485630628 331220592 403629794 527717955 844144169 178558784 342823487 399828699 492379439 390996959 864443504 45905747 656715337 952941943 400796778 38766804 387938506 741385322 733568133 125797777 768972977 284721914 735527288 357120700 82059867 114988902 127222074 882575911 238537308 624479353 280465076 755927258 23966207 323226498 405240289 86850860 693921503 791427234 514444049 416150185 785732604 371033225 718285840 97532993 59299705 984923578 83581081 517747597 179873924 42559619 288289752 947529050 593637628 460206137 786796937 928298552 847153510 212767691 357977066 318629855 290112346 784501618 45984956 407405343 31243096 995949084 590031544 5261245…
Output: 1 1 3 1 2 3 4 1 1 1 2 1 5 7 1 2 14 18 1 2 3 4 1 24 1 2 27 1 1 2 4 1 1 7 1 2 1 1 2 3 14 1 2 1 4 1 2 3 1 5 10 1 1 3 1 2 1 1 59 1 2 1 1 3 6 1 1 3 4 1 1 2 1 1 5 1 2 1 79 1 1 3 1 5 1 2 3 1 5 1 1 1 4 1 1 3 1 1 2 1 5 1 1 20 1 1 2 29 1 1 1 1 1 4 1 7 1 2 11 1 1 2 1 5 6 1 1 1 2 1 2 5 1 7 1 1 11 1 1 15 1 1 3 1 26 1 1 2 1 5 1 1 3 9 1 37 1 2 1 4 1 83 1 2 3 4 1 1 1 3 5 6 1 2 9 1 2 3 4 1 1 20 1 2 1 24 1 2 1 2 1 1 7 1 2 1 1 3 1 1 6 1 10 1 1 2 4 22 1 2 25 1 1 2 1 1 6 1 8 9 1 1 3 1 2 1 2 5 1 2 3 1 2 23 1 1 1 2 1 1 1 4 7 1 2 3 11 12 1 2 1 1 1 68 1 2 1 4 1 2 7 1 2 1 1 3 1 2 1 1 3 4 1 1 2 10 1 12 1 1 1 2 1 2 7 1 21 1 28 1 1 1 2 1 4 1 2 136 1 2 1 1 1 4 1 2 7 1 1 1 2 5 6 1 1 3 1 1 1 1 1 4 1 1 12 26 1 1 3 1 1 32 1 2 3 1 5 1 7 1 1 2 1 1 47 1 2 1 51 1 1 2 1 4 1 1 1 2 1 11 1 1 2 4 1 6 1 2 1 291 1 2 1 2 3 6 7 1 1 1 2…

Example 3:

Input: 3961 279880121 507404072 120772564 98513865 627719645 874146678 799272117 61431024 19412053 243123681 388987262 681790784 907074207 22117504 298695430 850863376 806178771 293068857 223029964 790246319 628346965 327411285 739388402 865980903 172514622 564720982 984884377 475826714 721836490 110151465 656079484 587523949 138571293 77879761 216974087 786819405 558725044 514533130 719531781 166482084 178034805 427622 504389620 802019948 371712679 58724057 664753430 531451200 466744699 385409357 172755996 504834092 446649391 786377886 639418220 501735965 283907528 806840943 570793483 865266689 476670147 894041461 52481519 273570384 392745251 930445400 375404221 416116391 450201934 894919688 909653473 266303957 117275999 58625668 150190718 41905571 362134861 568003162 289674560 965282066 4340412…
Output: 1 2 1 1 5 6 1 1 1 3 4 5 13 1 2 3 1 1 1 3 1 1 3 11 1 2 27 1 2 1 2 1 1 1 3 9 1 1 3 1 2 1 4 17 1 1 3 1 1 1 1 4 1 10 1 1 1 31 1 33 1 35 1 2 3 39 1 2 3 4 5 1 1 1 3 1 6 7 1 53 1 2 1 2 1 1 1 4 5 1 1 3 9 1 11 96 1 1 1 2 3 1 7 1 2 1 2 1 6 1 2 3 1 1 12 1 1 2 1 4 6 1 2 1 2 1 31 1 1 3 4 1 2 3 1 1 1 4 5 9 1 11 1 48 1 1 1 4 53 1 2 1 1 1 1 4 5 1 1 8 1 11 1 13 1 1 1 4 1 2 22 1 1 2 4 1 1 1 4 9 1 1 3 1 1 6 1 2 9 1 2 12 1 2 24 1 1 1 3 1 1 106 1 1 1 4 5 6 1 2 3 1 2 1 2 3 4 1 8 1 1 3 1 1 3 1 5 1 7 1 2 21 1 1 2 3 5 1 1 3 1 2 32 42 1 2 3 1 1 48 1 2 3 1 2 1 1 8 1 2 1 1 5 1 2 1 2 1 2 1 6 7 1 2 1 13 1 28 1 1 2 1 1 6 1 1 2 1 5 1 41 1 2 1 1 2 4 1 1 9 1 1 3 1 2 3 16 1 2 1 1 5 1 7 1 1 2 1 5 1 2 15 1 1 2 1 5 1 2 1 2 1 4 5 1 45 1 2 1 1 2 3 1 2 3 144 1 1 3 1 1 2 1 2 3 1 155 1 1 2 1 4 1 1 3 4 5 1 2 8 1 1 11 1 2 1 4 16 1 1 …

Constraints:

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

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