UVa 1121 Subsequence 解题报告（思维）

1121 - Subsequence

Time limit: 3.000 seconds

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 

Many test cases will be given. 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 there isn't such a subsequence, print 0 on a line by itself.

Sample Input 

10 15 
5 1 3 5 10 7 4 9 2 8 
5 11 
1 2 3 4 5

Sample Output 

2 
3

    解题报告：简单来说，就是找最短的和大于给定Ｓ值的子序列。对于每次新加入的数，计算最短需要的子序列的长度。代码如下：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <string>
using namespace std;

#define ff(i, n) for(int i=0;i<(n);i++)
#define fff(i, n, m) for(int i=(n);i<=(m);i++)
#define dff(i, n, m) for(int i=(n);i>=(m);i--)
typedef long long LL;
typedef unsigned long long ULL;
void work();

int main()
{
#ifdef ACM
    freopen("in.txt", "r", stdin);
#endif // ACM

    work();
}

///

int num[111111];

void work()
{
    int n, s;
    while(~scanf("%d%d", &n, &s))
    {
        int ans = ~0U>>1;
        int sum = 0;
        int sta = 0;

        ff(i, n)
        {
            scanf("%d", num+i);
            sum += num[i];
            while(sum>=s)
            {
                ans = min(ans, i-sta+1);
                sum -= num[sta++];
            }
        }

        if(ans==~0U>>1) ans=0;
        printf("%d\n", ans);
    }
}