#include <iostream>
using namespace std;
int main()
{
int k;
cin >> k;
while (k--)
{
int l, n;
int a[1010];
int begin = 0;
int max = 0;
int temp = 0;
cin >> l >> n;
for(int i = 1; i <= n; i++)
cin >> a[i];
for(int i = 1; i <= n-l+1; i++)
{
for(int j = i, len = 1; len <= l; len++, j++)
temp += a[j];
if(temp > max)
{
begin = i;
max = temp;
}
temp = 0;
}
cout << begin << endl;
}
}
南阳理工OJ_题目709 异形卵
最新推荐文章于 2014-05-23 14:16:18 发布