POJ3061-Subsequence

Subsequence

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 14715		Accepted: 6214

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

题意：给你一个有n个数的序列，问最少连续几个数的和是大于等于s，若始终不能大于s，输出0

解题思路：尺取法，设两个指针，尾指针不断向右移，若和大于等于s时，记录一下有几个数字，更新答案，然后头指针不断向右移，直至和小于s

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <map>
#include <bitset>
#include <set>
#include <vector>
#include <functional>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int n,s;
int a[100009];

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&s);
        for(int i=1;i<=n;i++) scanf("%d",&a[i]);
        int head=0,rear=0,mi=INF,sum=0;
        while(rear<n)
        {
            rear++;
            sum+=a[rear];
            while(sum>=s)
            {
                mi=min(mi,rear-head);
                sum-=a[++head];
            }
        }
        if(mi==INF) printf("0\n");
        else printf("%d\n",mi);
    }
    return 0;
}