#include<bits/stdc++.h>
#define debu
using namespace std;
const int INF=9999999;
const int maxn=1e5+50;
int n,s;
int a[maxn],sum[maxn];
void solve()
{
int ans=INF;
for(int j=0; j<n; j++)
{
int i=lower_bound(sum,sum+j,sum[j]-s)-sum;
if(i>0) ans=min(ans,j-i+1);
}
if(ans!=INF)
printf("%d\n",ans);
else printf("0\n");
}
int main()
{
#ifdef debug
freopen("in.in","r",stdin);
#endif // debug
while(scanf("%d%d",&n,&s)!=EOF)
{
for(int i=0; i<n; i++)
scanf("%d",&a[i]);
sum[0]=a[0];
for(int i=1; i<n; i++)
sum[i]=sum[i-1]+a[i];
solve();
}
return 0;
}
题目地址:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=679
题解:
(1)预处理前缀和sum[i],答案即为min{j-i+1}(sum[j]-sum[i-1]>=s)。由于sum[]递增且i应尽量大(使得长度最小)所以找一个让sum[i-1]<=sum[j]-s最大的i,即sum[i]>=sum[j]-s,不断更新答案即可。
(2)尺取法:右端点不断向右扩展,当sum大于等于s时,左端点向右扩展直到sum<s,然后继续扩展右端点,重复直到读完整个序列,期间更新答案即可。
#include<bits/stdc++.h>
#define debu
using namespace std;
const int INF=9999999;
const int maxn=1e5+50;
int n,s;
int a[maxn];
int main()
{
#ifdef debug
freopen("in.in","r",stdin);
#endif // debug
while(scanf("%d%d",&n,&s)!=EOF)
{
for(int i=0; i<n; i++)
scanf("%d",&a[i]);
int i=0,ans=INF,sum=0;
for(int j=0; j<n; j++)
{
sum+=a[j];
while(sum>=s)
{
sum-=a[i];
i++;
ans=min(ans,j-i+2);
}
// cout<<i<<endl;
}
if(ans!=INF)
printf("%d\n",ans);
else printf("0\n");
// cout<<"*************"<<endl;
}
return 0;
}