尺去和前缀和
Subsequence
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 29012 Accepted: 12178
Description
A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of the subsequence of consecutive elements of the sequence, the sum of which is greater than or equal to S.
Input
The first line is the number of test cases. For each test case the program has to read the numbers N and S, separated by an interval, from the first line. The numbers of the sequence are given in the second line of the test case, separated by intervals. The input will finish with the end of file.
Output
For each the case the program has to print the result on separate line of the output file.if no answer, print 0.
Sample Input
2
10 15
5 1 3 5 10 7 4 9 2 8
5 11
1 2 3 4 5
Sample Output
2
3
Source
Southeastern Europe 2006
#include<iostream>
#include<sstream>
#include<algorithm>
#include<string>
#include<iomanip>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
using namespace std;
int main(){
int T;
cin>>T;
while(T--)
{
int N,S,a[100010],sum[100010]={0};//数组a代表N个正整数,sum代表前i个正整数之和
cin>>N>>S;//输入N,S
for(int i=1;i<=N;i++)
{
cin>>a[i];
sum[i]=sum[i-1]+a[i];
}
if(sum[N]<S)//S太大
{
cout<<'0'<<endl;
return 0;
}
int res=N;
for(int s=1;sum[s]+S<=sum[N];s++)//连续的子序列,先确定左端点再确定右端点
{
int t=lower_bound(sum+s+1,sum+N+1,sum[s]+S)-sum;/*lower_bound从大到小算,sum[s]+S最少插在数组sum的那个位置(因为sum[s]+S>sum[1],所以从sum+s+1)
res=min(res,t-s);//取最少的个数
}
cout<<res<<endl;
}
return 0;
}