POJ 3061:Subsequence 查找连续的几个数,使得这几个数的和大于给定的S
2015-10-07 15:37
495 查看
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
Sample Output
题意是给出一个序列,要求从这个序列中找出几个连续的数,使得这些数的和大于给定的S,求这个数的最小值。
和51nod上面的建设国家很像,都是建立一个队列,然后不断查找。
代码:
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10172 | Accepted: 4160 |
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
题意是给出一个序列,要求从这个序列中找出几个连续的数,使得这些数的和大于给定的S,求这个数的最小值。
和51nod上面的建设国家很像,都是建立一个队列,然后不断查找。
代码:
#include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #pragma warning(disable:4996) using namespace std; long long n,s,a[1000005]; int main() { //freopen("i.txt","r",stdin); //freopen("o.txt","w",stdout); int test,i,ans,start; long long sum; scanf("%d",&test); while(test--) { scanf("%lld%lld",&n,&s); for(i=1;i<=n;i++) { scanf("%lld",a+i); } ans=n+1; a[0]=0; sum=0; start=1; for(i=1;i<=n;i++) { sum += a[i]; while(sum>s) { sum = sum - a[start]; start++; } if(sum+a[start-1]>s && i-(start-1)+1<ans) { ans=i-(start-1)+1; } } if(ans == n+1) { cout<<0<<endl; } else { cout<<ans<<endl; } } //system("pause"); return 0; }
相关文章推荐
- [LeetCode]Permutation Sequence
- iOS开发-UITextView的用法及技巧(ios7下光标bug解决方案)
- UI_动画
- BNUOJ 3685 Building for UN 联合国 【贪心】
- iOS新手入门之UITextField
- UVA 1152 4 Values whose Sum is 0
- 【iOS】UITableView实现的瀑布流效果
- POJ - 3709 K-Anonymous Sequence(斜率优化)
- Visual Studio 2015中创建C#的Android项目提示"Value cannot be null"的解决方法
- UITableView
- 为PopupWindow提供builder,绿化activity或fragment代码
- UITableView reload 单个 cell 的数据
- UVa 10881.Piotr's Ants【RuijiaLiu随书练习】【10月7】
- Win10最新专业版Build 10551系统截图曝光
- iOS的UIDatePicker时间控件
- iOS UIView 快速修改 frame
- iOS --- UIScrollView和UIPageControl的简单使用
- ios UI day01
- SpriteBuilder中的粒子系统属性
- SpriteBuilder中的粒子系统属性