POJ 3061Subsequence 【尺取法】
来源:互联网 发布:手机淘宝一元秒杀攻略 编辑:程序博客网 时间:2024/04/30 07:11
Subsequence
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14853 Accepted: 6283
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
210 155 1 3 5 10 7 4 9 2 85 111 2 3 4 5
Sample Output
23
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<queue>#include<stack>#include<vector>#include<map>#include<algorithm>using namespace std;#define ll long long#define ms(a,b) memset(a,b,sizeof(a))const int M=1e5+10;const int inf=0x3f3f3f3f;const int modd=1e9+7;int a[M],mod[M];int i,j,k,n,m;int S;int main(){ int T; scanf("%d",&T); while(T--){ scanf("%d%d",&n,&S); ms(a,0); for(int i=0;i<n;i++)scanf("%d",&a[i]); int sum=0,t=0,s=0; int ans=inf; while(1){ while(t<n&&sum<S){ sum+=a[t++]; } if(sum<S)break; ans=min(ans,t-s); sum-=a[s++]; } if(ans==inf)ans=0; printf("%d\n",ans); } return 0;}
阅读全文
0 0
- poj 3061--Subsequence(尺取法)
- poj 3061 Subsequence(尺取法)
- POJ 3061 Subsequence ( 尺取法 )
- POJ 3061 Subsequence(尺取法)
- Poj 3061 Subsequence【尺取法】
- poj 3061 Subsequence (尺取法)
- POJ 3061 Subsequence【尺取法】
- POJ 3061 Subsequence【尺取法】
- 尺取法 POJ 3061 Subsequence
- 【尺取法】poj 3061 Subsequence
- [尺取法] poj 3061 Subsequence
- poj 3061 Subsequence尺取法
- POJ 3061 Subsequence 尺取法
- POJ 3061 Subsequence 【尺取法】
- Poj 3061 Subsequence【尺取法】
- 【poj】 3061 Subsequence 尺取法
- POJ 3061 Subsequence 尺取法
- POJ 3061 - Subsequence(尺取法)
- java jar包启动 内存参数
- JavaScript闭包
- java开发C编译器:jvm函数调用时的参数传递
- 优化算法——人工蜂群算法(ABC)
- Java MyBatis自动生成映射文件
- POJ 3061Subsequence 【尺取法】
- DOS命令使用汇总
- 欢迎使用CSDN-markdown编辑器
- CPP类和对象—四个默认成员函数+运算符重载
- JAVA基础语法
- ganglia监控物理机
- python环境搭建,pycharm的配置,django安装及MySQL数据库配置
- ajax请求会有时间过程
- React Modal 的一种粗暴实现