CT52769

Faye's beacons Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the ivory gates of Alabast opens only for a perfect tally of beacons. Faye means to find out. 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: 102 904587660 864336454 181378433 755647828 633115516 576814632 440091892 75094576 16201361 643206041 905523596 727247045 110552410 217650207 90718851 530300443 42920897 620609442 230028123 69796257 345134002 29123824 184663750 352197113 577044882 211607893 966356175 370263547 948022640 970169342 739961228 294338748 980619531 36628356 578441072 735187879 500265454 94392149 692647287 735732399 221350214 154044467 335399454 917753133 296154286 724602621 236448012 372291435 473340657 138718469 265970319 407814168 588228355 283621901 388252934 82934212 233539077 755680761 6294531 768130985 688755489 954723307 314430520 432607168 407046345 78779394 439653945 671121574 314699860 523175373 856900120 852235930 158086605 753666045 249942400 690419305 27449378 585062071 774317326 914639676 454281473…
Output: 1 1 1 2 1 1 1 1 1 6 11 1 1 2 1 4 1 6 1 1 3 1 2 6 7 1 27 1 2 30 1 1 33 1 2 3 1 1 3 7 1 1 3 11 1 2 1 2 3 1 2 3 7 1 2 1 2 14 1 16 1 29 1 2 1 1 5 6 1 2 9 1 1 2 1 2 1 2 7 18 1 1 2 4 5 1 54 1 2 1 1 1 3 5 8 1 10 1 1 100 1 2

Example 2:

Input: 661 991032034 660173958 405942021 909322350 682114444 725719293 152074161 278385001 217338403 464501119 132375841 358383243 961427094 802643343 528051704 154058534 947738387 715863441 856262477 57447260 675009384 284251282 444270143 539250193 602836956 180193923 95675673 388434097 532653069 874192081 187789663 579712405 924326023 795269557 831660313 695016395 760626783 440103524 584703780 573444869 994151618 338383054 218617673 278555573 47300662 383063189 752565624 861389195 511405798 69909818 955319073 431011586 202630888 20663485 801916101 432602926 945311188 202617827 98349507 101366204 893732533 785859324 937071591 786758265 985296063 864000627 979563602 681435125 632830333 952835754 978195433 493426416 224507181 498790910 117545795 303162496 43662291 744853479 763628747 613048816 884…
Output: 1 1 1 3 1 2 1 2 1 4 1 2 12 1 1 1 4 1 2 1 2 1 2 3 4 1 1 3 4 13 1 2 16 1 2 1 2 1 2 1 41 1 1 2 1 5 6 7 1 1 10 1 1 1 4 1 6 1 1 2 4 1 6 1 24 1 2 1 1 3 4 1 1 3 1 2 1 7 8 1 10 1 2 3 4 5 1 1 1 1 4 1 12 1 1 1 4 1 2 1 2 3 4 1 6 65 1 1 1 3 4 1 2 3 4 9 1 2 3 4 1 2 7 8 19 1 1 3 4 1 1 2 1 5 1 2 1 2 14 1 1 17 1 1 2 40 1 2 1 1 2 6 1 2 3 1 2 1 2 1 15 56 1 1 3 4 1 1 7 1 2 1 1 1 6 7 1 2 3 1 2 6 21 1 2 1 4 5 1 1 8 1 1 3 89 1 2 3 1 1 3 4 8 1 1 3 4 1 1 7 8 1 2 1 2 5 6 7 1 1 1 4 12 1 2 1 4 1 1 2 4 37 1 1 3 1 5 1 2 3 1 5 1 2 1 9 1 2 3 1 1 1 7 1 1 1 20 1 1 3 1 1 3 1 2 1 7 31 1 1 1 4 5 1 7 1 2 3 1 2 13 1 2 1 4 1 1 1 4 1 2 3 1 5 10 296 1 2 1 1 1 6 7 8 1 2 3 4 1 2 3 1 1 3 1 1 1 10 1 1 25 1 2 1 2 1 1 1 4 5 6 1 1 2 1 13 1 2 1 2 5 1 2 1 1 25 1 1 2 1 5 1 1 2 1 10 1 2 1 2 5 1 1 8 1 10 1 1 1 1 5 1 2 1 9 1 21 1 1 3 1 2 1 4 …

Example 3:

Input: 3563 768982174 216475487 64568668 342645156 800824064 149522392 940465454 859252156 836441482 494697274 683869207 754824982 274573996 87874329 656049193 543688972 6802484 453995177 283765410 955235158 736816301 413725812 313214723 244914790 673891980 664351754 660438953 301711797 263084852 881133829 928949452 505606568 822521714 250700731 947104911 950931852 11742891 399071545 46767337 680061232 292508586 595672695 523260101 62830655 82447073 219851068 407055483 979942853 606999194 997370678 683298676 339566786 90269652 970508399 41069572 278421245 374927457 390545303 315227275 621903616 139308646 772110445 320457506 780793040 665029006 412754178 408242793 656613440 967830676 370160196 90961689 137611055 193640519 162229455 554244254 377281190 257525646 914143448 153598564 165065190 406274…
Output: 1 1 1 3 5 1 7 1 1 1 2 3 1 1 3 1 1 2 1 20 1 1 1 1 4 1 1 1 1 10 11 1 2 1 15 16 1 2 1 4 1 2 1 1 2 3 4 48 1 50 1 1 1 4 1 2 3 4 1 6 1 8 1 10 1 1 1 3 15 1 1 2 3 1 6 1 1 9 1 2 3 1 5 1 2 3 1 1 1 7 13 14 1 2 1 1 19 1 1 1 3 5 1 2 1 56 1 2 1 1 1 4 1 8 1 1 3 1 5 1 1 3 1 1 2 1 4 9 10 1 2 13 1 15 1 1 3 24 1 90 1 1 1 2 3 1 2 6 1 1 3 11 1 2 15 1 2 1 4 1 2 22 1 2 1 2 1 28 1 1 2 1 2 3 7 8 1 2 1 4 1 2 3 1 1 46 1 1 2 1 4 1 1 2 1 10 1 1 1 4 1 2 1 2 1 1 1 22 1 1 3 1 2 6 1 8 1 2 1 4 1 2 1 1 3 1 2 1 4 5 1 16 47 1 1 3 51 1 2 1 2 1 6 1 1 3 107 1 2 3 1 2 1 2 8 1 1 2 3 4 1 2 8 1 2 1 2 1 1 3 1 2 18 1 2 1 4 1 1 1 2 1 28 1 1 2 4 1 1 7 1 1 1 47 1 2 1 1 1 6 1 1 3 1 5 1 2 1 1 16 1 65 1 1 1 2 1 5 7 1 2 3 11 1 1 1 3 5 1 2 1 4 1 1 3 1 1 10 1 2 1 1 20 1 2 1 2 1 6 1 8 1 2 1 2 3 1 2 8 1 2 3 1 5 42 1 1 1 2 4 1 7 1 9 1 1 1 2 1 1 3…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Faye's beacons Streak Back - MEDIUM Coding Problem | CodeTikki