zoukankan      html  css  js  c++  java
  • POJ 3061 Subsequence(尺取法)

                            Subsequence
     

    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

    代码:
    #include<cstdio>
    #define min(a,b) (a<b?a:b)
    using namespace std;
    
    int main()
    {
        int sum[100005];
        int t,ans,i,N,S,temp,j;
        scanf("%d",&t)!=EOF;
        while(t--)
        {
            ans=1000005;
            sum[0]=0;
            scanf("%d%d",&N,&S);
            for(i=1;i<=N;i++)
            {
                scanf("%d",&temp);
                sum[i]=sum[i-1]+temp;
            }
            for(i=1,j=1;j<=N;j++)
            {
                if(sum[j]-sum[i]>=S)
                {
                    while(sum[j]-sum[i]>=S&&i<=j)
                    {
                        ans=min(ans,j-i);
                        i++;
                    }
                }
            }
            if(ans==1000005)ans=0;
            printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    性能优化与使用Block实现数据回传(3)
    封装思想和抽取(2)
    磁盘缓存的计算与清理(1)
    滑动返回的延伸(全局滑动返回功能)
    滑动返回功能被覆盖的解决思路
    OC之类与对象
    OC之OC与C的比较
    OC之知识储备篇
    C语言之总结3
    C语言总结2
  • 原文地址:https://www.cnblogs.com/homura/p/4669902.html
Copyright © 2011-2022 走看看