poj 3061 Subsequence
来源:互联网 发布:淘宝首页资源位 编辑:程序博客网 时间:2024/05/01 10:08
Subsequence
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10902 Accepted: 4512
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
题意:给定长度为n的整数数列以及整数S,求出总和不小于S的连续子序列的长度的最小值,如果解 不存在,输出0.
思路:用sum[]数组存储1到i的和,然后用二分法求长度
代码:
#include<stdio.h>#include<string.h>#define M 100010int a[M],sum[M],s,n;bool check(int x){for(int i=1;i+x-1<=n;i++){if(sum[i+x-1]-sum[i-1]>=s)return true;}return false;}int main(){int T,i;scanf("%d",&T);while(T--){scanf("%d%d",&n,&s);memset(sum,0,sizeof(sum));for(i=1;i<=n;i++){scanf("%d",&a[i]);sum[i]+=sum[i-1]+a[i];}int l=1,r=n+1;while(l<r){int mid=(l+r)/2;if(check(mid))r=mid;elsel=mid+1;}printf("%d\n",l==n+1?0:l);}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《《前加后去,,,》》
- 基于BoF的图像分类完整步骤(以ScSPM为例)
- Android开发技巧——定制仿微信图片裁剪控件
- c++试题(1)
- 最短路径问题
- 实现button的监听,3种方式
- poj 3061 Subsequence
- Hibernate学习篇07——manytoone简单实例
- 随机采样方法整理与讲解(MCMC、Gibbs Sampling等)
- Android 实现切换主题皮肤功能(类似于众多app中的 夜间模式,主题包等)
- 【ZOJ2676】Network Wars 最小割+01分数规划
- php读取网络文件 curl, fsockopen ,file_get_contents 几个方法的效率对比
- 共享MFC DLL的规则DLL 、带静态链接MFC的规则DLL和MFC扩展DLL区别
- 图像处理和图像识别中常用的OpenCV函数
- 事务隔离