POJ 3061 Subsequence
来源:互联网 发布:闪电下单软件 编辑:程序博客网 时间:2024/06/05 18:03
Subsequence
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11102 Accepted: 4604
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
Source
Southeastern Europe 2006
给出N个数,求最短子串和大于S
周赛题上说是二分,怎么感觉好像不是
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){int t,n,s,i,j,num[110000];scanf("%d",&t);while(t--){scanf("%d%d",&n,&s);memset(num,0,sizeof(num));for(i=0;i<n;i++)scanf("%d",&num[i]);int l,r;bool flag=false;int minn=0xfffffff;l=r=0;int sum=0;while(r<n){sum+=num[r++];while(sum>=s)//找到之后更新最优解 {flag=true;minn=min(minn,r-l);sum-=num[l++];}}if(flag)printf("%d\n",minn);elseprintf("0\n");}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《《前加后去,,,》》
- Struts2在eclipse运行的必须包
- ViewPager with FragmentPagerAdapter
- shellscript expect 用法
- YII2.0的文件上传, 并把文件名称重新编译
- beautifulsoup查找标签
- POJ 3061 Subsequence
- iOS学习之UI初级————CGAffineTransform坐标系统变换以及UIView的属性动画
- #java读书笔记#多线程2
- 2016面试——腾讯、蚂蚁金服、蘑菇街
- Java Map集合 转化为List 并为List排序
- 未完成的代码!
- Struts2与Struts1的区别
- 应用expect登陆服务器
- AndroidStudio 放弃Gradle使用Android.mk