poj 3061 Subsequence 尺取
来源:互联网 发布:淘宝药品必须货到付款 编辑:程序博客网 时间:2024/04/30 07:38
#include<cstdio>using namespace std;int min(int a,int b){ return a<b?a:b;}int a[100008];int main(){ int t; int sum,c,mins,f; scanf("%d",&t); while(t--) { int n,m; scanf("%d%d",&n,&m); for(int i=0;i<n;i++) { scanf("%d",&a[i]); } sum=0,c=0,f=0,mins=1000000; for(int i=0;i<n;i++) { sum+=a[i]; c++; if(sum>=m) { f=1; for(int j=i-c+1;j<i;j++) { sum-=a[j]; c--; if(sum<m) break; } mins=min(mins,c+1); } } if(f)//判断是否有解 printf("%d\n",mins); else printf("0\n"); } return 0;}
Subsequence
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15044 Accepted: 6371
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的最少个数。
阅读全文
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
- CSS 北京属性 尺寸属性 盒子模型 定位 选择器
- Python 模块
- 对基础背包的公式理解
- ==和equals的区别
- 应用PHP GD库中图像处理函数制作验证码
- poj 3061 Subsequence 尺取
- Codeforces Gym 101174 H. Pascal's Hyper-Pyramids (记忆化搜索)
- uva11538(组合数学)象棋中的皇后
- Dubbo入门实例
- poj-4148-生理周期-C语言-枚举
- 2017暑假七林集训day25
- ubantu一开机就显示连接已断开
- NYOJ 题目636
- Mac 下 终端停止和启动mysql服务 修改mysql的密码