博客介绍了如何解决POJ 3061题Subsequence的问题，提供了两种思路。思路一是通过创建一个存储数组前缀和的sum1数组，寻找最小长度的连续子序列；思路二是先找到初始大于S的子序列，然后逐步移除最前面的元素并添加后面的元素，直到找到最短的满足条件的子序列。
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 24814 | Accepted: 10475 |
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 sepa
最低0.47元/天 解锁文章
3481
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
