题目链接:http://poj.org/problem?id=3061
分析
这道题的题意是给定一个序列和一个值s,求出和不小于s的连续子序列的长度的最小值。这道题可以用二分+前缀,也可以用尺取法。
方法一:二分加前缀
#include<iostream>
#include<cstdio>
using namespace std;
const int N = 1e5 + 10;
int n,s;
int sum[N];
bool judge(int x)
{
for(int i = x; i <= n; i++)
if(sum[i] - sum[i - x] >= s) return true;
return false;
}
int main()
{
int T;
scanf("%d",&T);
int a;
while(T--) {
scanf("%d%d",&n,&s);
sum[0] = 0;
for(int i = 1; i <= n; i++) {
scanf("%d",&a);
sum[i] = sum[i - 1] + a;
}
int l = 0,r = n + 1;
while(l < r - 1) {
int mid = (l + r) / 2;
if(judge(mid)) r = mid;
else l = mid;
}
if(r == n + 1) printf("0\n");
else printf("%d\n",r);
}
return 0;
}
方法二:尺取法
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 100000 + 10;
int a[N];
int main()
{
int T;
scanf("%d",&T);
int n,s;
while(T--) {
scanf("%d %d",&n,&s);
for(int i = 0; i < n; i++) scanf("%d",a + i);
int st = 0,en = 0,ans = INF,sum = 0;
while(1) {
while(en < n && sum < s) sum += a[en++];
if(sum < s) break;
ans = min(ans,en - st);
sum -= a[st++];
}
if (ans == INF) ans = 0;
printf("%d\n", ans);
}
return 0;
}