CT42396

Dev and the Garnet registers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

It is audit day at the silver mines of Lodebarrow. Dev spreads the registers 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: 1752 3811709 24648689 583910388 506190033 328537373 655696489 26965654 508755163 415313411 866924473 549153440 720226967 336808677 538328997 10640431 817263990 922286615 840791832 576914533 194106376 936962764 56397900 528367155 973796426 880075330 880578147 670713528 145448002 599685931 425810998 442886153 435738320 2120830 644353433 176162764 91447556 197818390 481832563 519636718 129591951 908773256 761950808 367266824 389020466 714370248 351662077 648119179 210613766 385808606 154280303 418584436 823181943 897186324 45063491 184185848 53499383 760724483 383556160 851149198 85066534 121607360 540561421 447979447 282773844 336686087 158627157 867679427 788573256 551471729 822585623 117187587 536191237 501682944 497463500 23132274 226484211 866658094 212693122 558332413 359757614 65392997…
Output: 1 2 3 1 1 6 1 2 1 10 1 2 1 2 1 6 17 1 1 1 21 1 2 24 1 2 1 1 2 1 2 1 1 7 1 1 3 4 5 1 17 1 1 2 3 1 2 1 2 1 4 11 12 1 2 1 4 1 6 1 2 3 1 1 2 1 14 1 1 3 1 2 1 1 1 2 10 1 2 1 4 1 2 1 2 1 87 1 1 90 1 1 1 2 3 1 5 8 1 1 1 1 4 1 2 3 17 1 2 20 1 2 1 4 1 1 2 4 1 30 1 1 1 3 5 1 1 2 1 1 5 12 1 2 1 2 5 138 1 2 3 1 1 1 4 1 2 10 1 1 1 1 5 6 1 2 3 1 2 12 1 1 3 1 17 1 2 1 2 1 4 7 1 2 1 4 1 1 3 1 1 3 4 1 37 1 2 1 2 1 4 5 1 2 1 4 1 6 1 1 2 4 18 1 1 3 1 2 3 1 1 3 4 1 6 7 1 1 10 1 15 1 1 1 22 1 1 3 26 1 1 1 3 49 1 1 2 4 1 1 1 1 5 10 1 2 3 1 5 6 7 1 1 3 1 2 3 1 25 1 2 1 2 1 31 1 2 3 1 122 1 2 1 4 5 1 2 1 2 1 1 3 13 1 1 2 3 5 1 1 3 1 2 11 1 1 1 3 29 1 1 3 1 2 1 2 5 1 2 1 2 3 1 1 6 1 8 1 17 1 2 3 1 5 6 1 2 3 1 1 2 1 8 1 2 1 2 5 1 1 1 3 1 11 1 2 1 2 3 4 1 2 1 2 3 4 1 1 211 1 1 1 1 4 6 1 2 3 4 1 12 1 1 3 16 1 1 3 4 1…

Example 2:

Input: 3416 409781164 729978505 90649131 253679058 55739343 407885439 992740318 585546854 537584871 226531539 274240150 32367251 984436908 865461185 626547987 567861697 220519365 696931425 554994792 245777571 421896687 583150856 290811114 472745949 698779521 699363346 2172354 754465894 53359311 813923353 464989422 360975885 59282386 322836428 685750752 646827202 653772836 456684052 381042807 664454801 512438285 112436662 142364255 660317116 213554806 693953603 687470468 182404511 619100000 906621605 690179932 706983806 972729149 960330806 602448468 397264588 710617408 373724648 770958293 784253804 968197594 216628037 571033899 735788187 847718427 545100780 621119229 24592462 827840721 354790464 741920440 738794562 590119581 54169056 255583416 116064277 102847906 99637565 508455021 513310677 92150…
Output: 1 2 1 2 1 4 7 1 1 1 2 1 6 1 1 1 1 4 1 1 2 4 1 2 11 12 1 14 1 16 1 1 1 2 5 1 2 1 1 5 1 1 2 4 1 16 1 1 2 37 1 2 40 1 1 1 3 1 5 6 8 1 2 3 4 1 2 1 4 1 2 1 1 1 2 1 1 1 6 7 20 1 2 1 2 1 4 1 1 7 1 9 1 2 1 2 1 2 18 1 2 3 1 1 3 1 2 9 1 1 1 3 5 53 1 1 3 1 2 1 1 2 1 1 8 1 2 1 4 1 1 1 2 73 1 1 1 1 4 5 1 7 1 2 10 1 13 1 1 3 98 1 1 3 1 2 1 7 1 1 2 4 1 1 3 4 1 1 2 1 1 6 22 1 2 1 2 3 1 2 8 1 1 3 4 1 1 3 1 17 1 19 1 1 2 3 4 5 1 2 8 10 1 2 1 4 1 2 7 1 2 3 160 1 2 1 4 1 2 1 208 1 1 2 1 5 227 1 2 1 2 1 1 2 6 9 1 2 1 1 1 4 1 1 2 4 1 10 22 1 2 1 4 1 6 1 1 1 1 4 5 1 2 9 1 11 1 2 3 1 5 1 2 1 1 5 1 12 1 2 1 4 1 1 7 20 1 1 40 1 64 1 1 1 3 4 1 2 1 1 5 10 1 1 3 1 1 1 1 4 6 1 21 1 2 24 1 1 28 93 1 2 1 1 2 6 7 1 1 1 2 1 5 7 1 1 17 1 2 1 4 5 1 117 1 2 1 1 3 1 2 1 1 2 1 2 3 1 10 1 1 2 4 18 21 1 1 2 1 1 1 1 1 9 1 1 3 1 2 …

Example 3:

Input: 3554 169195894 954663582 341413435 941060000 599112172 644555835 287088602 786868962 121214444 630054710 49859536 756175687 245136182 610394643 434412299 28805219 502145001 407460636 553556083 588519449 530817114 185867606 723553428 356063466 796286889 831044818 998737149 322603030 433018482 659793910 672279379 293423736 349669192 721364241 248688209 628958483 256390342 780476063 242931277 996775320 650708530 325382489 27315560 101023561 89168585 756696022 425801978 671952461 461884260 66494191 189501490 595019862 868156727 676200058 423077731 837129041 200216177 610396911 472524881 730792455 260983225 987302823 657481998 584212141 73241237 437204450 931696440 382582685 442297619 260496323 408365782 169938007 353711257 382225537 406329096 239922704 354882815 435987096 923297954 311159200 4…
Output: 1 2 1 2 1 2 1 4 1 2 1 4 1 2 1 1 3 1 5 6 1 1 11 1 21 22 27 1 2 3 4 1 2 7 1 2 1 11 1 13 1 1 1 2 1 6 1 2 1 1 2 4 13 1 1 3 1 2 1 4 1 22 1 1 1 2 5 1 2 1 2 1 2 3 4 1 2 9 12 1 1 3 4 1 1 24 1 2 1 1 1 2 4 1 1 8 1 1 3 4 5 1 2 3 4 1 6 12 1 1 3 4 1 2 3 4 1 1 31 1 1 2 37 1 1 3 1 2 1 7 8 1 1 2 1 1 6 1 1 1 4 1 2 3 14 1 1 1 3 19 1 2 3 1 5 1 1 1 9 1 2 1 2 1 1 2 8 1 19 1 1 1 3 5 1 1 2 1 1 2 3 7 1 2 11 1 2 14 1 1 1 2 43 1 1 2 4 1 2 1 8 1 1 3 1 1 1 15 1 2 1 4 1 1 3 8 1 2 1 1 1 3 1 5 7 1 227 1 1 1 2 4 5 1 8 1 2 1 4 5 1 1 3 1 10 1 1 1 14 1 2 1 26 1 2 3 1 1 3 1 8 1 1 1 1 3 1 7 1 1 3 1 2 1 4 1 2 1 26 53 1 1 3 1 1 2 1 1 3 1 2 12 1 1 3 1 17 1 1 1 3 1 5 1 25 1 2 1 1 5 1 1 2 1 35 1 1 2 1 4 1 1 1 9 1 1 2 4 1 2 51 1 2 3 1 5 1 2 1 1 3 1 7 8 1 1 3 4 1 70 1 1 1 74 1 2 1 1 5 1 7 1 1 2 1 4 5 1 2 1 2 11 1 1 3 1 1 3 7 1 2 1 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Dev and the Garnet registers - MEDIUM Coding Problem | CodeTikki