poj3061
来源:互联网 发布:淘宝产品摄影技巧大全 编辑:程序博客网 时间:2024/05/23 18:48
Subsequence
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 10916 Accepted: 4516
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
2
10 15
5 1 3 5 10 7 4 9 2 8
5 11
1 2 3 4 5
Sample Output
2
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 10916 Accepted: 4516
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
2
10 15
5 1 3 5 10 7 4 9 2 8
5 11
1 2 3 4 5
Sample Output
2
3
#include<stdio.h>#define INF 0x3f3f3fint min(int x,int y){return x>y? y:x; }int a[1000010];int solve(int n,int s){int i=0,j=0,k,rec=INF,sum=0;while(1){for(;i<n&&sum<s;i++){sum+=a[i];}if(sum<s) break;rec=min(rec,i-j);sum-=a[j++];}if(rec==INF) printf("0\n");else printf("%d\n",rec);}int main(){int t,i,j,k,s,n;scanf("%d",&t);while(t--){scanf("%d%d",&n,&s);for(i=0;i<n;i++) scanf("%d",&a[i]);solve(n,s);}return 0;}
0 0
- poj3061
- POJ3061
- poj3061
- poj3061
- poj3061
- poj3061
- poj3061
- POJ3061
- poj3061
- poj3061
- POJ3061 Subsequence
- POJ3061 Subsequence
- POJ3061 Subsequence
- poj3061---Subsequence
- poj3061,3320
- POJ3061-Subsequence
- poj3061 Subsequence
- POJ3061-Subsequence
- cvReleaseImage出错问题
- leetcode:Delete Node in a Linked List 【Java】
- Ubuntu Sun JDK 安装
- #ifndef/#define/#endif使用详解
- Android签名验证简介
- poj3061
- cuda在vs2008中编程无法识别的外部符号(gpu加速的配置)
- 算法基础 - 树状数组(binary indexed tree)
- JAVA基础之IO操作
- 002.Java中有没有goto?
- uva10048 (floyd & kruskal)
- Adapter模式实战-重构鸿洋的Android建行圆形菜单
- 文章标题
- Ubuntu 14.4 server 版 安装gitlab记录