POJ 题目3061 Subsequence(水题)
2015-05-06 22:57
260 查看
Subsequence
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
Sample Output
Source
Southeastern Europe 2006
ac代码
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 9422 | Accepted: 3797 |
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
Source
Southeastern Europe 2006
ac代码
#include<stdio.h> #include<string.h> #define min(a,b) (a>b?b:a) __int64 a[101000]; int main() { int t; scanf("%d",&t); while(t--) { int n,i,j; __int64 k; scanf("%d%I64d",&n,&k); a[0]=0; for(i=1;i<=n;i++) { __int64 x; scanf("%I64d",&x); a[i]=a[i-1]+x; } int ans=100010; // int i,j; i=j=1; while(i<=n&&j<=n) { while(j<=n&&a[j]-a[i-1]<k) { j++; } if(j<=n) { ans=min(ans,j-i+1); i++; } else break; } if(ans==100010) ans=0; printf("%d\n",ans); } }
相关文章推荐
- 【poj 3061】Subsequence 【尺取法】or【前缀和+二分】
- POJ 3061 Subsequence (尺取法)
- Poj 3061 Subsequence【尺取法】
- POJ 3061 Subsequence
- POJ-3061 Subsequence(尺取法)
- POJ 3061 Subsequence
- poj 3061 Subsequence 简单题。。可以用二分也可用尺取
- POJ 3061 Subsequence(尺取法)
- Subsequence (二分)【POJ】-3061
- Poj - 3061 - Subsequence 【最基础的尺取法裸题】
- POJ-----3061---Subsequence---尺取法
- (尺取法)POJ 3061 Subsequence
- POJ 3061 Subsequence (迟取法_预处理,连续子序列)
- poj 3061 Subsequence
- POJ 3061 Subsequence
- 146_尺取法 subsequence (POJ No 3061)
- POJ 3061Subsequence 【尺取法】
- POJ 题目1458 Common Subsequence(最长公共子序列长度纯模板)
- poj 3061 Subsequence【简单尺取】
- poj 3061 Subsequence