[二分]poj3061 Susequence

Subsequence
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 9895 Accepted: 3999
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

给定长度为n的数列a[1…n]以及整数S,求出总和不小于S的连续子序列的长度最小值，如果解不存在，输出0。

预先用sum的值计算好，在子序列的起点S确定以后，就可以用二分搜索快速地确定使序列和不小于S的结尾t的最小值。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn=100010;
int num[maxn];
int sum[maxn];
int n,S;

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&S);
        sum[0]=0;
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&num[i]);
            sum[i]=sum[i-1]+num[i];
        }
        if(sum[n]<S)
        {
            cout<<0<<endl;
            continue;
        }
        int ans=maxn;
        for(int s=0; sum[s]+S<=sum[n]; s++) 
        //从sum[s+1]开始查找，s是开始查找的数的前一个位置
        {
            int t = lower_bound(sum+s+1,sum+n+1,sum[s]+S)-(sum+s);
        //sum+s是从第sum+s+1个地址开始查找的前一个地址，
        //所以找到的地址减去这个地址即为区间长度
            ans=min(ans,t);
        }
        printf("%d\n",ans);
    }
    return 0;
}