CT36707

Last beacons of Rosa

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

At the thorn maze of Bramblecourt, Rosa records each beacons in a worn leather ledger. The guild wants answers, not guesses. 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: 3439 327433759 66372019 243224728 513083425 594841207 948132570 998490483 581559474 32509588 748718666 883185129 585621383 297357074 365236870 832805835 66834334 886013091 646321520 320090685 403423449 337972637 541407267 45946380 763503755 409062290 525899642 3186668 934705702 689889071 498365201 784832037 34438421 49219697 966250657 736852143 672130293 949723477 869263078 922588792 206994351 587984200 855827922 120295261 150296299 570495559 980916442 85140905 228210522 170125943 148316749 646211649 889595048 320879426 488519666 256639356 141770375 367870797 828075477 498439481 243635977 219353316 387878226 935163062 137455212 293258834 100231732 882610244 207059929 951778136 754922172 652561571 247428654 264203172 286745575 9096925 11033824 24251963 947328894 40914057 270317205 988843115…
Output: 1 1 2 4 5 6 7 1 1 3 4 1 1 2 4 1 10 1 1 2 1 4 1 7 1 2 1 21 1 1 3 1 2 27 1 1 3 1 2 1 2 3 1 2 3 39 1 2 1 1 5 6 1 2 1 1 3 6 1 1 1 3 17 1 2 1 4 1 23 1 1 1 2 3 1 2 3 9 1 2 74 1 1 3 1 2 1 1 3 1 10 1 2 1 1 1 2 4 5 1 8 21 1 1 3 1 1 1 4 1 1 10 1 2 1 1 3 16 1 2 1 1 1 1 5 1 1 1 9 1 2 3 1 2 1 2 3 4 7 1 23 1 1 1 1 1 3 67 1 1 2 1 146 1 2 1 2 5 1 1 8 1 1 1 3 5 1 1 1 1 2 5 1 2 8 1 2 1 1 3 4 1 8 1 2 3 4 21 22 1 38 1 40 1 2 1 1 1 3 7 1 2 1 1 3 1 1 1 2 1 1 10 1 14 22 1 1 2 4 1 2 1 4 1 32 1 2 3 4 1 1 1 4 1 1 11 1 2 1 2 1 1 3 1 2 3 1 248 1 1 3 4 5 1 2 1 2 1 4 12 1 2 3 1 2 1 4 1 6 1 2 3 1 2 1 4 1 1 3 1 2 1 4 1 2 3 1 9 1 2 3 20 1 2 1 2 1 29 1 2 1 4 1 1 1 4 1 1 2 1 1 52 1 2 3 1 2 1 2 5 1 2 3 1 10 1 1 13 1 1 3 1 2 6 1 8 1 2 1 12 1 2 3 1 1 31 1 2 1 2 3 6 93 1 1 1 1 5 1 1 2 1 2 3 117 1 2 3 1 5 6 1 2 3 4 5 1 7 8 1 1 2…

Example 2:

Input: 3329 621776059 603209198 202794485 164792261 386231691 558364955 332778631 499715202 409011325 412389374 554197196 826750035 460829068 147313024 107575323 303534147 555432230 757421644 714536397 936898236 938703223 872761143 339609750 594480605 622374777 862525253 467249492 147771356 707276703 853693002 158226640 434931804 410662827 492953603 154507728 921505616 234976068 542532394 34090852 37970897 472552410 767309937 728253385 888315306 954200561 767323591 519520558 380926364 540623022 802390927 867862390 197846326 491983055 308923147 374254723 278826227 61196134 345769055 541309346 919665516 74990778 23097600 818457054 661490008 203959061 387259866 311552411 44126585 933031431 62542501 100067486 565201572 55145127 57847391 551107449 985395863 212353282 862022674 774577371 755725645 1391…
Output: 1 1 1 1 3 4 1 2 1 2 5 12 1 1 1 3 5 6 1 20 21 1 1 2 3 4 1 1 3 4 1 2 1 4 1 15 1 2 1 2 3 6 1 8 45 1 1 1 3 5 6 1 2 1 2 1 1 3 8 15 1 1 3 1 1 2 1 1 24 1 2 3 1 2 3 76 1 2 1 1 1 2 1 1 5 1 2 3 11 1 15 1 1 2 1 4 1 2 1 2 9 1 1 13 1 1 1 4 1 6 1 2 9 1 1 3 4 5 1 1 2 4 5 6 21 1 2 1 4 1 1 3 4 5 1 1 2 1 2 3 1 5 1 7 1 2 1 2 1 25 26 27 1 2 1 65 1 1 2 1 1 3 1 1 2 10 1 2 13 1 1 2 82 1 2 1 2 1 1 7 1 2 107 1 1 3 4 1 1 2 4 192 1 1 1 3 4 1 2 1 1 2 11 1 1 3 4 208 1 2 3 1 1 3 1 2 9 1 2 1 1 1 6 1 2 1 1 3 6 7 1 2 1 11 1 13 1 1 3 1 2 1 2 1 1 7 1 2 1 1 3 16 1 1 19 1 2 41 1 1 44 1 1 2 1 5 1 1 3 1 1 6 65 1 2 3 4 1 1 7 1 2 1 4 1 1 2 4 5 82 1 2 1 2 1 88 1 2 1 2 1 2 1 4 5 10 1 1 1 1 2 5 1 1 19 1 2 22 1 2 25 1 1 3 1 2 1 1 8 1 2 1 1 3 1 7 1 17 1 2 20 1 1 1 49 1 2 3 1 2 1 4 1 9 10 1 2 1 2 1 6 7 1 2 10 1 1 3 4 1 1 1 1 2 10 1 12 …

Example 3:

Input: 2662 814855116 996345924 913624418 524188472 803114250 364081629 259040199 744977051 149443083 568888969 452875510 788276359 132127803 298491910 944896198 448353693 686580371 289264272 409003059 125935584 857563456 895971405 638679046 696571462 945671765 270004001 118315605 301468218 589778717 159975953 959132782 966715546 18131137 374109865 720786613 225692905 881109709 803624099 996787999 418352930 374209879 284369615 417368499 487060899 453042621 909698273 519089659 332994655 744150968 309767712 221702696 702395494 553843159 548464985 230798063 826897466 886444845 83620207 156161115 950539411 235649956 188654657 435205682 97095699 64083315 460271886 404952000 276522453 963528590 675195034 94157251 624687469 144564 234946380 792418265 968811905 734389132 368880577 686740976 703418029 182…
Output: 1 2 1 1 2 1 1 3 1 2 1 7 1 2 13 1 2 1 2 1 6 7 1 2 23 1 1 3 4 1 29 30 1 2 3 1 5 1 39 1 1 1 3 5 1 7 1 1 3 1 1 3 1 1 1 10 11 1 2 21 1 1 3 1 1 6 1 1 30 1 1 2 1 2 6 37 1 1 2 3 1 2 1 8 1 2 1 2 5 1 7 16 1 2 3 1 1 2 23 1 1 2 3 1 1 1 1 9 10 71 1 1 1 4 1 1 7 8 1 1 2 4 1 2 1 2 3 10 1 2 13 1 2 3 4 1 1 7 1 1 2 4 1 6 1 1 2 10 1 1 1 2 15 44 1 2 3 4 1 1 2 1 1 10 126 1 1 2 3 1 5 1 8 1 2 1 1 5 1 15 16 1 1 1 4 5 6 1 24 1 2 1 28 1 2 1 2 1 2 5 1 7 1 1 2 11 1 15 1 2 1 1 2 6 1 2 1 2 1 1 3 6 1 2 3 1 11 1 15 1 1 2 4 5 21 1 2 1 2 240 1 2 3 4 1 2 7 1 2 10 1 1 2 1 1 1 3 8 1 2 1 1 1 1 4 26 1 2 3 1 2 3 33 1 1 1 37 1 2 1 1 3 1 2 1 9 1 2 1 4 5 1 2 3 1 2 1 2 3 1 1 2 4 1 1 1 30 1 2 3 1 2 3 1 1 2 10 1 2 1 2 1 1 1 1 2 20 1 2 1 4 1 6 1 1 29 1 2 32 1 2 1 4 1 2 1 8 1 10 1 1 2 14 1 2 79 1 1 3 1 1 122 1 2 1 4 1 2 7 8 1 2 11 1 1 3 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Last beacons of Rosa - MEDIUM Coding Problem | CodeTikki