CT43753

Galen and the Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the anvil district of Hammerfall as Galen unrolls the day's manifest of ledgers. The tally will decide the next shipment. 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: 2335 448316829 638770743 873826427 201510226 403306613 289140887 563958091 428795997 582629217 269608346 595994859 305021668 741436225 939351248 457294476 51252304 475690597 812835237 420100727 886778552 9324231 949722984 606257780 814000778 865386796 802524393 896998495 891294912 193251631 139390855 552347191 641535494 473622912 322184495 957147801 825555619 750143184 355723149 843262063 672911813 484573030 999818428 286265774 218401657 642762057 481140949 236772335 453228730 896301964 687904725 93643004 907510986 675397776 93419789 252040000 329978730 200672360 258869130 599864687 749462866 371460969 990415027 28257653 9303735 571030891 909047339 126948699 403579965 247734734 437630252 445897431 824026762 501679113 919359866 624100193 37965564 620031350 88497758 777727352 434907244 67255…
Output: 1 2 3 1 2 1 4 1 6 1 8 1 10 14 1 1 3 4 1 6 1 22 1 2 3 1 5 1 1 1 3 4 1 1 35 1 1 1 4 1 1 42 1 1 3 1 1 2 7 1 1 10 1 1 2 3 1 2 6 8 1 20 1 1 3 4 1 2 1 4 5 6 1 12 1 1 2 1 5 1 2 1 21 1 23 1 1 2 4 1 6 1 8 1 2 1 1 2 6 1 2 17 1 1 2 1 2 3 24 1 1 1 2 1 2 6 1 8 1 2 1 2 5 1 2 17 1 2 1 2 5 1 48 1 2 3 1 53 1 1 1 3 1 1 1 2 1 5 1 8 12 14 1 16 1 1 2 1 1 2 1 1 3 6 1 1 13 1 1 85 1 2 3 89 1 2 3 4 1 2 3 4 9 1 143 1 1 1 3 4 1 1 7 1 10 1 2 1 4 1 1 3 1 9 1 21 1 2 1 2 1 4 7 1 1 2 1 2 6 1 2 1 2 3 1 1 2 4 1 2 1 2 1 13 1 1 1 3 1 2 6 1 1 2 1 1 6 7 14 1 1 17 1 2 3 4 1 1 3 1 2 1 4 1 1 7 1 1 13 228 1 1 2 4 1 1 3 1 2 6 1 1 3 14 1 1 1 18 1 1 3 1 2 1 1 2 6 10 1 12 13 1 1 1 2 1 5 1 1 40 1 1 3 1 5 1 7 1 1 10 11 12 1 1 3 1 5 1 2 1 9 1 2 1 2 1 1 5 1 9 31 1 2 1 1 2 1 4 1 2 3 1 10 1 1 1 1 1 3 1 5 21 1 1 2 1 1 3 1 7 1 2 1 4 5 1 2 3 1…

Example 2:

Input: 2047 153774908 381753927 870702110 801992371 13932199 741545540 279056706 108164358 264004857 643016840 84910936 764406708 31928164 213133082 571914932 194005152 8416934 757805122 378539525 755166414 703054357 963260496 218085592 48740897 165877228 160351450 338402901 175103312 938975672 802027157 495148323 201128407 245964396 855158634 576711478 935715705 815517309 91855147 468902014 784661802 773739908 722089180 881317026 978749852 749669077 294409077 931406063 222772458 955790233 228459043 793071554 516093392 799782145 83138938 643919016 78515057 961703316 336183362 216117571 309122984 79965727 997919242 481360272 609599537 892419163 830378455 544637521 521889545 878216373 976653489 228475076 256203536 189433092 942112100 679288679 143307148 894363612 585362725 540363797 463390432 31275…
Output: 1 2 3 1 1 2 1 1 2 4 1 8 1 2 3 1 1 6 1 2 1 22 1 1 2 1 5 1 7 1 1 1 2 5 1 7 1 1 2 3 1 1 7 44 1 1 3 1 5 1 2 1 4 1 2 1 13 1 1 2 1 62 1 2 3 1 1 1 4 8 1 2 1 4 1 1 3 1 1 1 1 12 1 2 1 2 5 1 2 8 1 22 1 2 1 2 3 6 7 1 1 10 1 1 1 14 1 2 1 2 5 1 1 1 23 1 2 1 2 3 1 1 1 3 1 5 1 1 3 13 1 2 18 1 1 74 1 2 3 1 79 1 1 3 1 84 1 2 1 2 3 4 7 1 1 2 11 1 2 1 1 3 1 5 1 20 1 22 1 2 3 1 2 1 1 2 9 1 33 1 2 1 4 1 1 40 1 1 1 3 4 6 1 1 3 1 1 3 1 2 9 1 2 3 1 2 3 1 2 6 1 2 1 2 1 1 13 1 18 1 35 1 37 1 2 1 1 3 4 1 45 1 1 3 4 1 2 1 8 1 10 11 1 1 2 1 5 1 1 3 1 2 6 1 1 2 4 1 1 2 3 1 2 1 2 1 1 5 1 2 1 4 1 1 1 23 1 2 1 27 1 2 3 1 2 1 4 1 1 7 1 1 3 52 1 1 1 4 1 1 1 1 3 1 1 1 1 8 9 1 2 1 2 1 4 1 17 18 1 2 1 1 3 6 1 2 1 2 11 12 33 1 2 103 1 2 1 2 1 1 1 6 1 1 1 1 2 3 1 16 1 2 3 1 2 1 2 3 1 5 1 1 8 11 1 2 3 1 2 3 1 1 1 4 1 2 27 1 2 3 4…

Example 3:

Input: 2689 986375892 959129923 681402868 292783982 626253539 376115087 939251191 495554130 460534637 256934447 737039804 141689143 332702157 289882080 379015927 178153832 630376198 622577054 946403361 692138227 811993816 730498485 973518863 904483194 996402837 976180444 60417973 381068299 890476308 280556371 876372884 668721166 738083974 494140785 304045153 153490508 681711191 870352940 623711851 887298604 806653170 332960819 937466522 955615249 901528844 481262036 601059263 710718228 596878483 970235187 127757631 349855260 159277335 477622290 991973989 872555262 309252024 737530799 522522415 128732257 4774362 514229745 277130360 551604096 402254783 795386527 239000301 776004094 940655207 199313959 949506978 561334740 644373481 711795888 701762119 567894211 966213639 493550725 470108255 57820634…
Output: 1 1 1 1 2 1 5 1 1 1 4 1 2 1 4 1 6 1 17 1 2 1 22 1 25 1 1 2 3 1 2 1 2 1 1 1 4 7 1 11 1 1 17 18 1 1 2 3 1 24 1 2 1 4 30 1 1 2 1 1 1 3 1 6 1 10 1 2 14 1 16 1 2 3 1 1 22 1 1 3 4 1 6 1 1 1 2 1 6 1 8 1 1 2 1 1 20 1 1 3 1 1 6 1 1 106 1 1 3 1 1 3 4 1 1 3 8 9 1 1 2 4 17 1 2 3 1 1 1 1 25 1 2 1 2 5 1 2 1 2 1 6 1 8 1 2 1 1 13 1 2 3 1 2 3 1 8 1 1 11 1 2 3 1 1 6 7 1 20 1 22 1 2 3 1 5 1 47 1 1 2 1 77 1 2 3 4 1 1 7 1 1 10 1 1 1 14 1 2 1 4 5 6 7 1 2 1 4 1 1 2 3 5 1 2 3 13 1 1 3 1 1 1 7 28 1 1 3 4 5 1 7 1 2 1 11 1 2 3 4 1 1 7 1 9 1 50 1 1 3 1 2 1 1 3 1 7 1 9 1 2 1 4 1 6 1 2 18 1 1 2 4 26 1 1 170 171 1 1 3 4 5 1 1 3 1 2 1 4 13 1 15 1 1 2 3 1 6 1 2 1 1 1 6 28 1 1 3 1 1 1 4 1 6 1 2 9 1 14 1 16 1 1 3 1 1 1 3 5 25 1 2 1 29 1 31 1 1 2 1 1 5 1 1 1 3 1 5 7 1 1 2 1 1 3 6 1 9 1 2 1 2 1 2 1 6 1 1 1 4 1 6 7 16 17 1 72 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Galen and the Streak Back - MEDIUM Coding Problem | CodeTikki