POJ3061 Subsequence[队列求区间和]

Subsequence

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6746		Accepted: 2465

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

 

 

 

 

题意：按照顺序给定一组数，求出这组树中和大于等于m的最短子序列。

 

 

题目的实质是维护一个队列，方向从左向右，保证队列中所有数值和大于等于m，并保证最短的长度值。

 

 

code：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

int data[100100];
int n,m;

int fun()
{
    int i=0,j;
    int minx=0x7fffffff;
    int sum=0;
    for(j=0;j<n;)
    {
        while(sum<m&&j<n)
            sum+=data[j++];
        while(sum>=m)
        {
            minx=min(minx,j-i);
            sum-=data[i++];            
        }
    }
    if(minx==0x7fffffff)
        return 0;
    return minx;
}

int main()
{
    int t;
    int i;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(i=0;i<n;i++)
            scanf("%d",&data[i]);
        printf("%d\n",fun());
    }
    return 0;
}