zoukankan      html  css  js  c++  java
  • poj 3061 Subsequence

    题目连接

    http://poj.org/problem?id=3061 

    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<algorithm>
     2 #include<iostream>
     3 #include<cstring>
     4 #include<cstdlib>
     5 #include<cstdio>
     6 using std::min;
     7 using std::lower_bound;
     8 const int Max_N = 100010;
     9 int arr[Max_N], sum[Max_N];
    10 void solve(int n, int s) {
    11     int res = n;
    12     if (s > sum[n] || s < sum[1]) { puts("0"); return; }
    13     for (int i = 0; sum[i] + s <= sum[n]; i++) {
    14         int t = lower_bound(sum + i, sum + n, sum[i] + s) - sum;
    15         res = min(res, t - i);
    16     }
    17     printf("%d
    ", res);
    18 }
    19 int main() {
    20 #ifdef LOCAL
    21     freopen("in.txt", "r", stdin);
    22     freopen("out.txt", "w+", stdout);
    23 #endif
    24     int t, n, s;
    25     while (~scanf("%d", &t)) {
    26         while (t--) {
    27             scanf("%d %d", &n, &s);
    28             for (int i = 0; i < n; i++) {
    29                 scanf("%d", &arr[i]);
    30                 sum[i + 1] = sum[i] + arr[i];
    31             }
    32             solve(n, s);
    33         }
    34     }
    35     return 0;
    36 }
    View Code
    By: GadyPu 博客地址:http://www.cnblogs.com/GadyPu/ 转载请说明
  • 相关阅读:
    Centos7安装Python3的方法
    word2vec原理(二) 基于Hierarchical Softmax的模型
    word2vec原理(一) CBOW与Skip-Gram模型基础
    爬虫的危害有多大
    python线程池实现
    进程和线程、协程的区别
    程序的编译与解释之间的区别
    【python3】如何建立爬虫代理ip池
    可能是史上最全的机器学习和Python(包括数学)速查表
    python 元类
  • 原文地址:https://www.cnblogs.com/GadyPu/p/4544771.html
Copyright © 2011-2022 走看看