Every season at the lotus ponds of Tranquil Basin, someone must prove the quality of the harvest. This year the task falls to Galen, armed only with the scrolls register. Task: Print the maximum sum of any contiguous subarray of length exactly k. Input format: First line: n and k. Second line: n integers. Output format: Print the maximum window sum. Constraints: 1 <= k <= n <= 1884; -1000000 <= a[i] <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 1884; -1000000 <= a[i] <= 1000.
