zoukankan      html  css  js  c++  java
  • 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
     1 #include"iostream"
     2 #include"cstdio"
     3 #include"cstring"
     4 #include"algorithm"
     5 using namespace std;
     6 const int ms=100004;
     7 int a[ms];
     8 int sum[ms];
     9 int n,S;
    10 void solve()
    11 {
    12     sum[0]=0;
    13     for(int i=0;i<n;i++)
    14         sum[i+1]=sum[i]+a[i];
    15     if(sum[n]<S)
    16     {
    17         puts("0");
    18         return ;
    19     }
    20     int ans=n;
    21     for(int s=0;sum[s]+S<=sum[n];s++)
    22     {
    23         int t=lower_bound(sum+s,sum+n+1,sum[s]+S)-sum;
    24         ans=min(ans,t-s);
    25     }
    26     printf("%d
    ",ans);
    27     return ;
    28 }
    29 int main()
    30 {
    31     int T;
    32     cin>>T;
    33     while(T--)
    34     {
    35         cin>>n>>S;
    36         for(int i=0;i<n;i++)
    37             cin>>a[i];
    38         solve();
    39     }
    40     return 0;
    41 }

     O(n)

    #include"iostream"
    #include"cstdio"
    #include"algorithm"
    #include"cstring"
    using namespace std;
    const int ms=100004;
    int a[ms];
    int n,S;
    void solve()
    {
        int s=0,sum=0,t=0;
        int ans=n+1;
        while(1)
        {
            while(t<n&&sum<S)
            {
                sum+=a[t++];
            }
            if(sum<S)
                break;
            ans=min(ans,t-s);
            sum-=a[s++];
        }
        if(ans>n)
        {
            puts("0");
            return ;
        }
        printf("%d
    ",ans);
        return ;
    }
    int main()
    {
        int T,i;
        scanf("%d",&T);
        while(T--)
        {
            scanf("%d%d",&n,&S);
            for(i=0;i<n;i++)
                scanf("%d",&a[i]);
            solve();
        }
        return 0;
    }
  • 相关阅读:
    数据库设计
    构建评价
    Schema xds文献
    架构设计评价
    需求分析评价
    获取script的链接参数并执行
    js获取封装对象/通过id tag className
    通过css/js来固定div的位置
    nginx日志分析工具goaccesss
    如何快速安装 allure
  • 原文地址:https://www.cnblogs.com/767355675hutaishi/p/3949834.html
Copyright © 2011-2022 走看看