CT39689

The beacons at Brimstone

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Odin found an old ledger of beacons in the timber yard attic at the sulphur springs of Brimstone. The margin notes pose a precise question. 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: 2509 309627441 749214594 597349451 694201315 602371631 923868993 257881664 885268091 205373649 666294997 506618265 346258373 885933316 443992506 204491793 474051137 950898287 298317458 991565917 571325268 894391192 435997540 411128140 290907274 997262558 350708453 368522138 699406412 237784693 362247874 933769917 145965026 725741568 850087880 283969453 5651205 143387820 738543146 266303645 179193347 438389370 833926330 383620254 672539985 460196337 831324968 404054699 685163558 891716076 884915258 237185672 429447263 177865003 607073646 551434611 101694473 688989858 853639314 975219188 675719930 690518722 251155853 650355959 190567707 72193010 193220659 664898396 375635109 352564364 183771677 560723208 653976981 802095214 737908451 98577361 70029310 768009734 847514814 860821797 84593179 7…
Output: 1 2 1 2 1 6 1 2 1 2 1 1 7 1 1 3 17 1 19 1 2 1 1 1 25 1 2 3 1 2 6 1 2 3 1 1 2 4 1 1 3 8 1 2 1 4 1 2 18 1 1 2 1 4 1 1 7 8 34 1 2 1 2 1 1 3 6 1 1 1 4 5 14 1 1 1 4 19 20 1 2 1 4 25 1 2 1 1 5 31 1 2 1 1 5 1 1 8 1 2 42 1 1 3 4 1 6 1 1 1 10 1 12 13 1 2 1 1 1 1 3 6 1 1 2 4 1 6 7 1 2 1 2 5 6 1 1 2 1 11 1 28 1 1 1 4 1 1 1 150 1 1 2 3 4 1 6 1 2 1 2 12 1 1 3 1 5 1 1 8 1 2 1 1 1 6 7 1 2 1 19 1 2 22 1 24 1 1 1 4 29 1 2 1 4 1 2 1 8 1 2 40 53 1 1 1 3 5 6 1 1 1 3 4 1 2 1 15 1 1 2 1 2 3 6 1 1 2 1 4 5 14 1 2 1 4 1 1 1 1 2 4 7 1 1 3 1 1 3 1 15 1 2 1 2 24 1 2 3 1 1 1 1 2 33 1 1 1 4 1 1 1 3 9 1 2 74 1 1 1 3 1 5 81 1 1 2 3 5 1 2 8 1 1 2 4 5 6 1 8 1 2 11 1 102 1 2 3 1 1 3 7 1 1 1 2 4 1 2 1 1 2 1 7 20 1 2 1 4 1 2 1 8 9 1 1 2 1 4 1 2 3 9 1 1 2 1 14 1 2 26 1 2 3 1 1 2 1 2 1 7 1 2 1 1 2 13 1 2 1 2 18 1 1 2 1 1 6 1 2 …

Example 2:

Input: 411 529554808 61963076 397623059 237398460 620078309 445537265 259163204 938265327 300579924 498297425 145328495 654452208 57675416 217595995 116298004 359613918 611635567 612054111 19425123 108904960 137035245 714829748 74004691 45575025 735607749 318438858 653738327 748539314 6421077 338906489 475880696 640997500 156674024 594445345 255767538 915701900 126551047 995844636 434321906 852769982 694709069 299371232 745863730 43697024 41884630 3966603 835546976 862078314 951391845 913297584 801918425 385460028 50823309 565442680 322963577 200727122 909113818 137970655 287081817 661937857 626549741 175573713 670087212 312229460 605192845 997830545 907206194 851786664 265279342 500095530 313234279 242542048 639566419 53633532 416527158 403779580 297799326 104231210 503609995 41502528 330119810 …
Output: 1 1 2 1 5 1 1 8 1 2 1 4 1 2 1 4 5 6 1 2 3 14 1 1 17 1 2 20 1 2 3 4 1 2 1 28 1 38 1 2 1 1 3 1 1 1 7 10 11 1 1 1 1 3 1 1 7 1 2 3 1 1 6 1 2 66 1 1 1 2 1 1 5 1 2 1 1 1 6 1 2 9 1 16 1 20 1 1 2 1 5 1 2 3 1 1 2 1 5 1 7 1 17 1 2 1 1 42 1 2 3 1 1 1 1 4 1 1 2 3 1 5 1 1 9 1 1 1 4 1 1 3 4 1 1 25 1 2 1 2 1 1 2 8 1 2 3 4 1 2 3 41 42 1 2 3 4 1 1 3 1 9 1 2 12 1 1 1 1 3 1 2 3 4 10 23 1 1 3 1 2 1 1 2 9 1 1 2 36 1 1 3 1 5 1 88 1 1 2 1 2 3 1 5 9 1 2 1 4 1 2 1 4 1 10 150 1 1 1 1 2 1 2 6 8 9 1 1 2 14 1 16 1 1 3 4 1 1 2 1 1 10 1 1 2 1 2 1 7 8 9 1 2 1 1 3 1 5 1 18 1 2 1 2 3 4 5 1 7 8 1 1 13 14 1 1 3 46 1 2 1 4 51 1 2 1 4 1 2 3 8 1 10 1 1 3 65 1 2 1 4 5 1 1 2 1 2 11 1 2 1 1 3 1 1 19 1 1 3 1 1 3 1 2 3 29 1 1 2 3 1 2 1 8 1 1 11 1 1 1 2 5 1 1 3 1 5 1 2 1 4 1 11 122 1 1 1 1 5 1 2 1 2 3 11 1 2 3 4 1 2 1 2 1 2 7 1 1 3 1…

Example 3:

Input: 3785 784757151 702901514 803836712 442044718 916025141 215905691 49429544 628263244 361217931 548050039 641604158 388187109 399615271 971691888 457296613 149143231 819297473 270832290 248974526 189385806 159422543 799947393 662922835 703450834 138908938 504464644 452547286 711059374 486731634 78140299 670100008 181948668 362969092 666866397 120408242 95248179 920193684 176631754 897202933 273236238 122712550 643857262 447012254 833349597 962386729 754401651 945754403 862791188 785819653 453758150 555417298 381030598 318777246 550759930 789044072 269107434 713565441 799429268 956083979 907904648 6675344 446332822 911314552 574035212 10598268 251585415 763970430 93152607 829506339 602524376 48720717 48692057 427812930 93083032 721305193 303223104 625494079 740313483 707528956 223220377 68659…
Output: 1 1 3 1 5 1 1 3 1 2 6 1 2 14 1 1 3 1 1 1 1 5 1 2 1 2 1 6 1 1 3 1 2 3 1 1 23 1 2 1 1 3 1 5 31 1 2 1 1 1 2 1 1 3 7 1 2 10 14 1 1 2 4 1 1 2 4 1 6 1 1 1 3 1 6 1 2 9 1 1 2 1 1 6 1 1 24 1 2 3 1 1 3 4 1 1 2 1 2 1 7 1 58 1 2 1 4 5 1 7 1 9 1 1 1 4 1 6 1 2 9 1 2 3 1 5 1 1 2 3 4 1 6 13 14 15 1 2 1 4 1 2 3 144 1 2 1 2 3 1 1 2 4 5 9 1 1 3 13 1 1 2 1 4 1 2 8 1 10 26 1 1 1 3 5 1 2 1 2 3 1 2 6 7 15 1 2 1 2 3 1 7 1 1 2 4 1 2 14 1 2 3 1 1 1 4 1 2 24 1 2 1 4 1 2 7 47 1 2 3 4 1 1 2 8 1 2 1 2 230 1 1 1 2 1 2 7 1 2 1 4 12 1 2 3 1 5 1 1 3 1 2 6 1 13 1 1 16 1 2 1 1 2 22 1 2 1 4 1 2 1 4 1 1 2 1 4 1 7 1 9 14 1 2 3 1 2 3 4 1 6 1 2 12 27 1 1 2 4 1 2 3 1 2 3 1 39 1 1 3 4 1 2 3 85 1 2 1 1 1 4 5 1 2 1 4 5 1 1 3 1 1 1 12 20 1 1 2 1 5 1 2 1 9 1 1 2 1 2 3 1 8 1 2 1 2 1 4 1 1 9 47 1 1 2 3 1 5 1 1 1 1 4 6 1 1 2 4 1 65 1 1 2 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The beacons at Brimstone - MEDIUM Coding Problem | CodeTikki