Think:
1循环数组
2细心循环数组的循环值位置
以下为Accepted代码
#include <bits/stdc++.h>
using namespace std;
int main()
{
int T, n, m, i, t, mav;
int a[204], b[204];
scanf("%d", &T);
while(T--)
{
scanf("%d %d", &n, &m);
for(i = 0; i < n; i++)
scanf("%d", &a[i]);
memset(b, 0, sizeof(b));
for(i = 0; i < n; i++)
for(t = 0; t < m; t++)
b[i] += a[(i+t)%n];
mav = b[0];
for(i = 1; i < n; i++)
mav = max(mav, b[i]);
printf("%d\n", mav);
}
return 0;
}