CT44207

Keeper's Peak per Window Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the ribbon falls of Cascade Vale with crates of beacons, and Keeper the log keeper must account for every last one. Task: For every contiguous window of length k, print the maximum. Input format: First line: n and k. Second line: n integers. Output format: Print n-k+1 maxima space-separated. Constraints: 1 <= k <= n <= 4000; -10^9 <= a[i] <= 10^9.

Example 1:

Input: 2439 1278 -436116088 381619006 577029028 778981301 -390855190 -931355682 -467139691 82763760 -903043087 602147335 -136753628 150289875 -894342086 -890961436 -719661685 -838852982 835061247 221370551 897426939 -111397884 713549198 487191692 -385650460 -267797599 -138609991 961251058 -609045301 -192175852 289682885 352961186 957091225 151082877 -196080096 -380891220 246432453 -598485503 -567152607 -658446642 456849059 129493361 639815193 196507633 937919778 -835671460 867563197 637927933 939623683 213733390 442614115 -712869943 767325628 -109730752 556624351 844367660 -823146059 513416044 -392363246 123009377 -202719184 211356712 640731007 -869651290 -142729745 -944028393 613141059 674452365 -398815729 -440248946 -319939655 -4034611 17184230 411625437 115963831 264679790 -832509871 -91595136…
Output: 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 999011455 …

Example 2:

Input: 2893 2255 -434685735 908735361 271899578 -284815435 -827332735 -230105602 -317043337 514663093 -330769224 721039024 -843518986 -471623582 -565666034 -255262353 786348045 515199295 709379787 819570755 -144313583 228426134 629952856 -847884482 290370969 637393122 -961367711 472888244 -92884768 -659653674 -13408897 486695798 115494733 -42357596 586754424 98006775 357227809 -514198964 16504568 671594543 -689600474 -89018661 444496943 -25944262 -68780317 125017009 245943890 -810286977 -711441253 628852599 693455610 -494427669 753828537 -72510558 990037785 140366743 364703393 -676671035 294146355 657220409 927003208 -196311759 201925703 25533992 44467379 845171555 2647347 -308737338 819556356 453216632 -118762670 -199363524 57661694 -276704884 99080661 867243958 -525303032 -505590036 791168263 7…
Output: 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 999593483 …

Example 3:

Input: 3867 2235 -203058211 768019802 -341817136 550630671 -777210106 593413890 53588602 959151594 513813805 -542276120 -694554826 858321968 536882492 501771279 -499798168 92587529 -31344699 -661076980 690845967 770786899 -122725559 980102676 -990956618 -53803273 -993926210 231875179 851765815 558712317 327135910 685730546 -366940947 -564946391 923863262 696555685 662244815 229821622 -925028463 498320123 422096526 759169623 -996561767 -492277585 -697945884 858086069 271691461 808344112 -957422159 -458879800 -633420841 -228625857 383112704 -456450525 702139461 -997793815 282967400 -701086787 498270080 89541189 989325644 -976992143 -773184646 426461110 -230620069 354890919 885963687 -289678097 -835236729 -385938443 550613480 -894635125 217007976 -462462483 121100260 -960928666 593825373 -540485698 …
Output: 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 999500940 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Keeper's Peak per Window Ledger - MEDIUM Coding Problem | CodeTikki