#abc267c. [abc267_c]Index × A(Continuous ver.)
[abc267_c]Index × A(Continuous ver.)
Problem Statement
You are given an integer sequence of length .
Find the maximum value of for a contiguous subarray of of length .
Notes
A contiguous subarray of a number sequence is a sequence that is obtained by removing or more initial terms and or more final terms from the original number sequence.
For example, and are contiguous subarrays of , but and are not contiguous subarrays of .
Constraints
- All values in input are integers.
Input
Input is given from Standard Input in the following format:
Output
Print the answer.
Sample Input 1
Sample Output 1
When , we have . Since it is impossible to achieve or a larger value, the solution is .
Note that you are not allowed to choose, for instance, .