Poj3061Subsequence
来源:互联网 发布:淘宝贴吧论坛 编辑:程序博客网 时间:2024/06/08 00:16
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;
题解: 尺取法:
这是他的执行过程。
先找到一个大于s的序列,然后对这个序列处理,直到小于s,然后在加入后面的数字,不断的循环。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[100000+10];int main(){ int T; scanf("%d",&T); while(T--) { int n,m; scanf("%d%d",&n,&m); for(int i=0;i<n;i++) { scanf("%d",&a[i]); } long long sum=0; int st=0,en=0; int ans=0x3f3f3f3f; while(1) { while(en<n&&sum<m) sum+=a[en++]; if(sum<m) break; ans=min(ans,en-st); sum-=a[st++]; } if(ans==0x3f3f3f3f) ans=0; printf("%d\n",ans); } return 0; }
- poj3061Subsequence
- POJ3061Subsequence
- Poj3061Subsequence
- poj3061Subsequence(尺取法)
- define \enum \const 定义一个常量
- PWM是什么
- extern "c"用法解析
- 输入任意年月,输出当月日数(包含闰年判断)
- 无线轮播加小圆点
- Poj3061Subsequence
- 笔记day6、day7
- C语言指针实现简单队列
- 深度优先搜索DFS
- 用IDEA创建maven项目使用tomcat插件方式完成web前后端应用
- sudoers(5)
- Ubuntu 16.04 笔记
- 【常用排序算法】以最简单的方式理解快速排序
- 智能卡操作系统COS概述