题目:
http://poj.org/problem?id=3061
题意:
给定一个序列,求总和不小于s的连续子序列的最小长度,不存在输出0
思路:
尺取法
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100010, INF = 0x3f3f3f3f;
int arr[N];
int main()
{
int t, n, s;
scanf("%d", &t);
while(t--)
{
scanf("%d%d", &n, &s);
for(int i = 1; i <= n; i++) scanf("%d", &arr[i]);
int en = 1, sum = 0, res = INF;
for(int i = 1; i <= n; i++)
{
while(en <= n && sum < s)
sum += arr[en++];
if(sum >= s) res = min(res, en - i);
sum -= arr[i];
}
printf("%d\n", res == INF ? 0 : res);
}
return 0;
}