Problem 2013 A short problem
Accept: 76 Submit: 206
Time Limit: 1000 mSec Memory Limit : 32768 KB
Problem Description
The description of this problem is very short. Now give you a string(length N), and ask you the max sum of the substring which the length can't small than M.
Input
The first line is one integer T(T≤20) indicates the number of the test cases. Then for every case, the first line is two integer N(1≤N≤1000000) and M(1≤M≤N).
Then one line contains N integer indicate the number. All the number is between -10000 and 10000.
Output
Output one line with an integer.
Sample Input
2
5 1
1 -2 -2 -2 1
5 2
1 -2 -2 -2 1
Sample Output
1
-1
福大月赛,表示难度适中, C和最后一题略难,没出。
最大子串和的加强版,只需要把 m个数看成一个数,并且再加个判断是否加了 m 个数就可以了。复杂度 O(n)
代码