CT48781

The Streak Back of the Gilded beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The measurer Zara has been asked to prepare the winter inventory. On the desk lies a long table of beacons 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: 768 577954741 876565013 243864158 298436491 779442635 361023575 45695797 89224116 206084929 849023486 912175963 518098627 47805285 125010556 480574992 41613485 33683817 63508561 298086960 763095778 779349700 619997388 24834269 982439589 105815735 734675742 274950067 361003966 582521924 225423234 754443229 655328655 289441137 728641664 526462578 787038042 238207524 654984011 424233296 600186340 526195879 281804208 366846913 482050039 445241564 622087942 320613860 948074513 291990468 54394140 445729200 52606719 670196884 430039108 537969169 484494620 180669886 3832131 742679698 192164141 433224348 518555122 314763949 941942371 753701553 329530417 28598656 494347957 78954457 555365632 691655485 254600583 834934681 500199587 179567609 106773499 297114341 846371165 840732042 759961443 363844558…
Output: 1 2 1 2 3 1 1 2 3 8 11 1 1 2 3 1 1 3 4 9 10 1 1 24 1 2 1 2 3 1 7 1 1 3 1 12 1 2 1 2 1 1 2 3 1 8 1 24 1 1 3 1 5 1 2 1 1 1 11 1 2 3 1 16 1 1 1 3 1 5 6 1 9 1 1 1 3 14 1 1 1 1 1 2 21 1 1 3 1 1 1 28 1 2 1 2 1 1 2 8 77 1 1 2 3 5 6 1 2 3 4 11 1 2 1 2 3 6 95 1 1 2 3 1 1 1 2 3 9 1 1 13 1 2 1 2 3 4 1 6 1 1 1 1 5 12 1 1 3 1 2 1 2 22 36 1 2 3 4 1 6 1 2 1 1 3 1 2 1 1 10 1 1 2 1 4 1 17 1 25 1 2 3 4 1 6 7 1 1 1 36 1 2 194 1 2 3 4 1 2 1 8 1 2 3 1 2 1 1 2 4 5 8 1 2 3 4 1 2 3 8 1 1 1 4 1 6 15 1 1 37 1 1 1 1 3 1 2 8 1 1 2 1 5 1 7 1 1 2 4 1 2 3 1 9 1 1 2 3 21 1 2 1 25 1 2 1 2 1 6 1 1 3 1 2 3 83 1 1 2 4 1 1 3 1 1 2 4 1 1 14 1 1 3 1 1 3 1 2 1 1 3 1 7 1 2 1 4 1 13 1 2 1 4 5 1 40 1 2 1 1 3 6 7 1 1 3 4 12 1 2 1 4 1 2 1 8 1 1 1 1 4 1 1 3 1 1 2 1 5 1 2 3 1 10 1 2 13 1 2 1 2 86 1 1 1 2 3 1 2 7 1 1 1 4 13 1 2 1 2 1 6 …

Example 2:

Input: 2738 28322894 353554361 858996367 605042471 455793537 540106531 422845740 783234387 699269486 45666429 117855426 944463996 191474469 601377223 625349730 280130126 291353563 615869571 768997131 954879807 261612520 101704125 589416502 230110064 205695640 667153134 466281415 626951564 250542576 996971918 849629290 259035731 970918019 940643903 562310055 610675157 967914644 300860738 187015195 74424605 480507651 61596756 41579954 819010469 528110981 559802279 956083439 200103683 374799883 75562354 57089761 381185155 93147472 830715247 545731771 542608299 908538160 466342038 433227106 829645699 97957804 109207664 453157789 211028673 384107084 65529650 456309358 515857293 419449324 736104822 600035732 332408834 95285486 896558826 320876190 663524665 472480706 366576210 620941006 226563844 129204…
Output: 1 2 3 1 1 2 1 5 1 1 2 12 1 2 3 1 2 3 7 20 1 1 3 1 1 6 1 2 1 30 1 1 3 1 1 2 4 1 1 1 4 1 1 7 1 2 10 1 2 1 1 5 1 7 1 1 10 1 1 3 1 2 3 1 2 1 7 8 1 10 1 1 1 17 1 2 1 1 3 1 1 35 1 1 48 1 2 3 4 1 6 1 2 3 1 1 6 1 1 3 4 1 6 1 8 1 1 78 1 2 1 1 5 1 85 1 1 1 4 1 1 1 2 1 6 1 2 1 10 1 2 17 1 1 2 4 1 2 3 25 1 1 1 1 2 116 1 2 1 1 2 1 2 6 9 1 2 1 4 1 2 7 1 1 10 1 1 3 1 1 2 1 2 5 1 2 12 1 1 1 1 5 1 1 1 4 1 2 3 8 14 1 16 29 1 1 3 1 2 1 4 8 1 2 1 1 5 1 1 1 2 1 2 1 8 1 1 1 1 4 5 1 2 1 1 3 11 1 1 2 3 30 1 1 1 2 82 1 1 3 1 2 3 1 1 6 1 1 2 10 1 1 1 4 5 19 1 1 1 4 1 2 1 4 1 1 7 1 1 3 15 1 2 1 4 1 2 7 8 1 1 3 1 2 1 4 1 6 33 1 2 1 4 1 6 1 2 1 1 11 1 2 3 15 1 2 3 4 1 21 1 2 3 1 5 1 2 1 4 1 1 2 3 1 1 7 17 1 73 1 1 2 303 1 2 3 1 1 6 1 1 2 10 1 2 1 2 1 4 1 2 3 1 11 22 1 2 1 1 1 4 7 1 1 2 4 5 1 14 15 1 2 3 1 2 1 4 1 2 1 …

Example 3:

Input: 2513 667279865 499323758 222655938 296704467 784910818 249559204 433076279 293922971 505244923 684684439 61702792 953022938 351720402 425068603 501845174 493088667 128646586 776976677 45859004 141216689 849084700 70317632 674560938 581289223 299976712 657026842 155547821 226382938 871764788 837809462 970956886 195787542 602305411 391283126 550765338 745398039 798954079 79391085 750167364 203013066 131067088 102681141 946566339 653901401 498236624 685993467 910122215 811724537 405328889 341167406 683192173 640614206 192452793 932324986 628351692 562915755 2876230 115311314 521380176 675380981 296404049 44427115 678896484 449669035 257846626 438302824 79510944 613390165 788491388 40513096 467748823 444106610 217030456 866014964 55786464 21808051 296548100 908730214 819011584 987043278 547951…
Output: 1 1 1 2 5 1 2 1 4 5 1 12 1 2 3 1 1 6 1 2 9 1 2 1 1 3 1 2 17 1 31 1 2 1 2 5 6 1 2 1 1 1 12 1 1 3 4 1 1 1 3 1 1 11 1 1 1 2 3 6 1 1 9 1 1 2 1 5 15 1 2 1 1 20 1 1 3 24 1 80 1 1 3 4 1 1 2 1 5 1 1 8 1 1 3 4 1 1 7 1 1 2 1 5 1 2 1 1 1 2 4 1 1 7 1 9 1 14 1 2 1 2 1 6 1 2 1 10 1 2 3 4 1 2 1 18 1 20 1 2 3 4 1 1 2 47 1 1 1 2 3 1 6 1 9 1 1 2 1 2 5 63 1 1 1 2 1 4 5 6 1 10 1 2 3 1 1 1 3 1 6 1 8 100 1 2 103 1 2 1 2 5 6 1 1 9 1 1 3 1 2 6 1 1 3 1 1 12 22 1 2 1 133 1 1 3 1 1 3 1 1 2 1 2 3 4 5 8 1 10 15 232 1 2 1 1 5 1 1 3 9 10 1 2 1 2 15 1 2 1 2 1 1 3 6 1 1 1 3 1 1 6 1 2 1 1 18 1 1 3 4 5 1 2 26 1 2 29 1 2 3 1 1 6 1 37 1 2 1 1 3 4 61 1 1 2 3 1 2 3 1 1 2 10 1 2 14 1 2 3 1 1 3 4 1 1 7 1 1 2 4 1 2 3 32 1 1 1 4 37 1 1 1 3 4 1 44 1 1 2 4 5 50 1 2 3 1 2 56 1 1 2 1 1 6 1 1 3 1 1 3 4 1 1 2 1 1 2 1 15 1 1 3 1 2 1 1 2 9…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Streak Back of the Gilded beacons - MEDIUM Coding Problem | CodeTikki