Every season at the saffron fields of Marigold Row, someone must certify the cargo before shipping. This year the task falls to Cora, armed only with the stretches 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 <= 2072; -1000000 <= a[i] <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 2072; -1000000 <= a[i] <= 1000000.
