POJ-3061 Subsequence（尺取法）

const int maxn=100100;
int a[maxn];
ll sum[maxn];

int main()
{
int T;
cin>>T;
while(T--)
{
int N,S;
cin>>N>>S;
clr(sum);
for(int i=1;i<=N;i++)
{
cin>>a[i];
sum[i]=sum[i-1]+a[i];
}
if(sum
<S) cout<<0<<endl;
else
{
int len=maxn;
for(int i=0;sum[i]+S<=sum
;i++)
{
int res=lower_bound(sum+i,sum+N,sum[i]+S)-sum;
len=min(len,res-i);
}
cout<<len<<endl;
}
}
return 0;
}

const int maxn=100100;

long long sum[maxn];
long long num[maxn];

int main()
{
int T;
scanf("%d",&T);
while(T--)
{
clr(sum);
int N,S;
scanf("%d%d",&N,&S);
for(int i=1;i<=N;i++) scanf("%lld",&num[i]);
int cnt=1;
ll sum=0;
int len=INF;
queue<ll> q;
while(cnt<=N)
{
while(sum<S)
{
q.push(num[cnt]);
sum+=num[cnt];
cnt++;
//cout<<sum<<endl;
if(cnt>N) break;
}
if(sum<S) break;
int L=q.size();
len=min(len,L);
while(sum>=S&&!q.empty())
{
sum-=q.front();
q.pop();
if(sum>=S)
{
int L=q.size();
len=min(len,L);
}
}
}
cout<<(len==1e9?0:len)<<endl;
}
return 0;
}

const int maxn=100100;

int a[maxn];

int main()
{
int T,N,S;
cin>>T;
while(T--)
{
cin>>N>>S;
for(int i=1;i<=N;i++) cin>>a[i];
int res=N+1;
int s=1,t=1,sum=0;
for(;;)
{
while(s<=N&&sum<S) sum+=a[s++];
if(sum<S) break;
res=min(res,s-t);
sum-=a[t++];
}
cout<<(res==N+1?0:res)<<endl;
}
return 0;
}