CT53702

Archivist's beacons Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

It is audit day at the island market of Coralcove. Archivist spreads the beacons records across the table and picks up a sharp pencil. 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: 2530 292912719 730769870 967117835 507125648 686989240 522920515 926498659 793729319 831669644 594706757 382534875 961612477 701483069 516254213 930637496 158900833 718394695 577734982 421283883 175321664 79799144 365190730 139019391 336784317 565931923 161389483 607844538 844819499 783898985 492635252 572951516 981131882 164694127 551363847 315634042 552204384 348138185 810976738 940956369 590566171 953059360 160906280 242504444 720333481 121502311 130882544 450923894 659043798 31745188 902120297 555068205 294173201 99274247 547813554 108564202 993714617 576811273 585636023 412714725 538797860 245943886 297692661 62498545 737332736 121685947 78288326 912235696 465490856 380446447 261258417 964162867 734607383 98665326 838519 429885052 168953657 248017814 425587136 77634818 246446954 30794…
Output: 1 2 3 1 2 1 4 1 2 1 1 9 1 1 3 1 2 1 1 1 1 3 1 2 7 1 10 13 1 1 2 32 1 2 1 4 1 6 7 1 9 1 2 3 1 2 3 4 1 9 1 1 1 3 1 56 1 2 1 2 1 2 1 8 1 1 11 1 1 1 15 1 1 1 3 1 2 3 1 2 3 11 1 1 2 4 1 2 7 8 1 10 11 1 2 1 4 1 1 7 1 2 1 104 1 2 1 1 2 4 1 1 9 1 2 3 4 1 2 1 1 1 1 7 1 9 1 2 1 2 1 4 1 1 2 1 20 1 2 1 1 1 1 3 41 1 1 2 3 1 1 1 1 9 1 2 3 1 2 6 1 2 59 60 1 2 1 2 1 6 1 8 1 1 2 1 4 1 6 1 2 3 1 1 2 4 1 1 10 190 1 1 2 3 1 5 7 1 9 1 11 1 13 1 1 2 3 4 1 1 2 8 1 2 1 1 2 14 1 16 1 1 20 1 2 1 2 1 2 7 1 1 1 11 1 1 3 1 1 6 1 2 9 1 1 3 1 45 1 1 3 1 1 6 7 1 2 1 2 3 4 7 1 1 3 1 2 6 1 1 1 24 1 1 1 2 1 4 7 1 2 1 4 1 2 7 1 2 1 4 1 13 1 2 1 4 1 2 3 1 5 1 2 3 13 1 2 3 4 1 2 1 41 1 1 2 1 4 5 1 1 9 1 2 3 13 1 2 3 1 2 1 20 62 1 1 65 1 2 3 1 1 2 7 1 2 3 76 1 2 3 1 1 1 4 1 9 1 1 1 2 1 2 6 7 94 1 1 1 1 1 1 7 1 1 3 1 2 131 1 133…

Example 2:

Input: 2969 579896642 495807763 151905557 713616237 616479254 930532278 359119505 705376280 553516146 854861325 685212859 847298746 337452991 184983016 659307605 96845149 448516241 395864906 796913133 327673775 657217705 557478945 837109003 319791055 244128537 438482895 577613757 297824201 529573833 990563542 259951509 943873827 89821693 172982513 218042340 482463952 183596742 756164472 251813140 293619244 409573945 991665071 349208225 761839914 136252891 661440300 792491760 313700764 296655443 323693937 573515774 617477214 673087077 938050930 827569856 956492380 245551537 511526295 468622196 373625141 464684411 473764792 460592019 728994199 561654841 545281765 977590058 960836714 351515762 424539775 838078296 547578916 323441163 963482824 74246201 124118047 261568598 885833506 91232155 788676342…
Output: 1 1 1 4 1 6 1 2 1 4 1 2 1 1 3 1 2 1 7 1 2 1 11 1 1 3 4 1 2 30 1 2 1 2 3 4 1 6 1 2 3 42 1 2 1 2 5 1 1 3 4 5 6 12 1 14 1 2 1 1 2 4 1 8 1 1 25 1 1 2 3 1 1 7 1 2 3 4 1 2 3 1 1 2 1 12 1 1 3 4 49 1 2 1 4 5 1 1 3 4 1 6 1 2 3 1 1 2 4 1 1 1 4 1 1 2 1 9 1 2 1 1 14 1 2 24 1 1 1 2 5 1 1 3 4 5 1 7 1 9 1 46 1 2 1 2 1 2 7 1 2 1 11 1 1 65 1 1 3 1 2 1 4 1 2 3 1 1 1 1 5 1 1 1 2 1 2 15 1 2 1 2 1 4 1 8 1 97 1 2 1 2 1 1 3 8 1 2 1 4 110 1 1 1 1 2 4 1 7 1 2 1 2 1 2 15 16 1 2 3 20 1 2 1 4 1 1 3 1 2 1 2 1 1 1 3 7 1 2 1 1 5 1 1 1 3 17 1 2 1 1 2 4 7 8 1 36 1 2 1 2 1 1 5 44 1 1 1 1 2 1 1 2 3 1 1 2 10 11 13 15 1 2 1 4 85 1 1 3 89 1 1 3 1 1 2 1 4 1 2 3 1 10 1 2 13 1 2 16 1 18 1 1 1 4 5 1 1 2 1 28 1 2 1 2 1 6 1 1 3 4 11 1 41 1 2 3 1 2 3 1 5 1 51 1 2 1 58 1 1 1 3 1 2 1 7 1 10 1 1 13 1 15 1 2 3 1 1 6 7 1 1 3 1 5 1 7 1 1 3…

Example 3:

Input: 2262 725723641 571904260 461743978 587151851 222357876 814143147 774012275 821988528 843203952 791375680 130293281 849559773 61051999 822394835 785304960 355882450 989395750 140102872 941373260 718069992 976190792 324478280 134317673 130356570 439648714 612615222 565428494 669241337 233202881 687192454 368194968 692628273 207153008 876393235 325967833 97632196 136868137 640054171 259421200 110323016 766867587 469423233 896738639 163597951 391384246 504217211 884528919 102966367 823411773 188765364 783322205 517980131 893604396 628594847 477661670 759888988 84337650 670101694 86489065 525567187 552549807 173693191 643707076 256686794 54556518 380461522 712447038 563368144 875823460 613533794 490738373 474157287 652062982 248485532 631460407 736713328 125391316 410640819 794663326 500865973 …
Output: 1 1 1 3 1 6 1 8 9 1 1 12 1 2 1 1 17 1 2 1 4 1 1 1 4 5 1 7 1 9 1 11 1 13 1 1 2 4 1 1 7 1 22 1 2 3 4 1 2 1 2 1 10 1 1 3 1 2 1 2 3 1 5 1 1 3 11 1 16 1 1 1 4 1 2 7 1 2 10 1 1 2 4 1 1 7 1 9 1 69 74 1 2 1 1 1 6 1 8 1 2 1 2 1 4 1 16 1 2 1 2 1 1 3 6 1 2 9 12 1 14 1 16 1 1 1 1 4 6 1 1 1 4 1 1 1 2 47 1 2 3 1 1 2 1 5 1 57 58 1 2 1 2 3 1 2 3 7 10 11 1 2 1 1 1 6 1 2 1 4 1 23 24 1 2 1 4 1 1 7 1 2 1 1 3 6 1 2 3 1 5 1 2 1 1 2 3 4 13 1 1 1 2 1 6 1 207 1 1 3 1 5 1 2 3 1 5 1 1 1 4 5 1 2 3 4 1 1 12 1 2 3 16 1 18 1 2 1 2 1 2 1 1 2 10 29 1 2 1 250 1 1 1 3 1 2 1 1 2 6 10 1 1 1 3 1 2 1 2 5 1 7 22 1 2 1 4 1 1 3 1 2 1 1 5 1 7 8 1 1 2 12 1 2 1 4 1 25 1 1 2 1 4 6 1 1 3 4 11 1 2 1 2 1 42 1 1 2 4 1 2 1 2 1 10 1 77 1 1 1 1 5 1 2 8 1 2 1 2 13 1 15 16 1 2 3 4 1 6 1 1 1 1 11 1 29 1 2 3 1 1 2 7 8 1 2 1 12 1 1 3 16 1 18 1 49…

Constraints:

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

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