Subsequence-oj

Subsequence

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 16650		Accepted: 7072

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

个人理解:假设用a数组存下输入的数字，若存在s，使得以a[s]开始总和最初大于S时的连续子序列a[s]+...+a[t-1],这时a[s+1]+...+a[t-2]<a[s]+...+a[t-2]<S;利用这个性质就可以设计如下算法：
（1）以s=t=sum=0初始化。
（2）只要依然有sum<S，就不断将sum增加a[t]，并将t增加1。
（3）如果（2）中无法满足sum>=s则终止，否则的话，更新res=min(res,t-s)。

 
 
结果
时间
内存
语言
Accepted
79
596
C++
代码：

 
 

  
  
#include<cstdio>  
#include<cstring>  
#include<algorithm>  
#include<string>  
#include<cmath>  
#include<iostream>  
#include<map>  
#include<queue>  
using namespace std;  
typedef long long LL;  
const double INF=1e9;  
  
int a[100000+10];  
int main()  
{  
    int T,n,S;  
    scanf("%d",&T);  
    while(T--)  
    {  
        memset(a,0,sizeof(a));  
        scanf("%d%d",&n,&S);  
        for(int i=0; i<n; i++)  
            scanf("%d",&a[i]);  
        int s=0,sum=0,t=0,res=n+1;  
        for(;;)  
        {  
            while(t<n&&sum<S)  
            {  
                sum+=a[t++];  
            }  
            if(sum<S)  
                break;  
            res=min(res,t-s);  
            sum-=a[s++];  
        }  
        if(res>n)  
            res=0;  
        printf("%d\n",res);  
    }  
return 0;
}