ZOJ-3714

水题，我用了O(m*n)算法，有O(n)算法，不过数据这么小就懒的写了

#include<stdio.h>int main(){int i, j, t, n, m, a[200];scanf("%d", &t);while (t--){scanf("%d %d", &n, &m);for (i = 0; i < n; i++)scanf("%d", &a[i]);int max = 0, sum;for (i = 0; i < n; i++){sum = 0;for (j = i; j < i + m; j++)sum += a[j % n];if (sum > max)max = sum;}printf("%d\n", max);}return 0;}