（二分搜索法&&尺取法）subsequence

最新推荐文章于 2021-05-13 22:42:15 发布

每天学点

最新推荐文章于 2021-05-13 22:42:15 发布

阅读量288

点赞数

CC 4.0 BY-SA版权

分类专栏： C/C++/Python/Java/Matlab

请勿用于任何商业用途；转载的话请加上我的地址；

本文链接：https://blog.youkuaiyun.com/qq_40828914/article/details/81322286

C/C++/Python/Java/Matlab 同时被 2 个专栏收录

291 篇文章 ¥39.90 ¥99.00

订阅专栏

C/C++

217 篇文章

订阅专栏

本文介绍了如何解决寻找一个长度为n的数列中，总和不小于给定整数s的连续子序列最短长度的问题。提供了两种方法：尺取法和二分搜索法。尺取法通过调控左右端点实现遍历，二分搜索法则通过前缀和结合lower_bound函数快速找到满足条件的子序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

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