poj——3061Subsequence(尺取法 求最小数量满足S)
来源:互联网 发布:mac chili色号 编辑:程序博客网 时间:2024/05/22 11:46
Subsequence
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12317 Accepted: 5171
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
#include<iostream>#include<string>#include<cstring>#include<algorithm>#include<cstdio>#include<cmath>using namespace std;int n,m;int a[100010];void solve(){int sum=0;int k,p,q;k=q=0;p=n+1;for(;;){while(k<n&&sum<m){sum+=a[k];k++;}if(sum<m)break;p=min(p,k-q);sum-=a[q];q++;//cout<<q<<endl;}if(p<n)cout<<p<<endl;else cout<<"0"<<endl;}int main(){int t;cin>>t;while(t--){cin>>n>>m;memset(a,0,sizeof(a));for(int i=0;i<n;i++)cin>>a[i];solve();}return 0;}
1 0
- poj——3061Subsequence(尺取法 求最小数量满足S)
- POJ 3061 Subsequence——尺取法
- POJ——3061Subsequence(尺取法)
- poj——3320Jessica's Reading Problem(尺取法 求最小看书页数)
- POJ 3061 Subsequence (尺取法)
- [ACM] POJ 3061 Subsequence (尺取法)
- poj 3061 Subsequence(尺取法)
- POJ 3061 Subsequence(二分/尺取法)
- POJ-3061Subsequence(尺取法)
- POJ 3061 Subsequence(尺取法)
- POJ 3061 Subsequence(尺取法)
- POJ 3061 Subsequence(尺取法)
- POJ:3061 Subsequence(尺取法)
- POJ 3061 Subsequence(尺取法)
- POJ 3061 Subsequence (尺取法)
- POJ 3061 Subsequence(尺取法)
- Subsequence(POJ No.3061)(尺取法)
- poj 3061--Subsequence(尺取法)
- POJ3435 Sudoku Checker
- 180.User SCOTT wants to perform a bulk insert operation in the EMP_DEP table. SCOTT receives the fol
- git仓库整理实战
- poj——3320Jessica's Reading Problem(尺取法 求最小看书页数)
- Linux下查看进程占用内存的最好方式
- poj——3061Subsequence(尺取法 求最小数量满足S)
- poj——2456Aggressive cows(二分搜索 求牛牛之间最大距离)
- prefuse同时做多个图---解决不连通图的坐标原点
- poj——1064Cable master(二分搜索 求绳子可以满足的最大长度)
- 体育之美
- poj——3169Layout(差分约束 求第一只牛到第n只牛最大距离)
- poj——3255Roadblocks(优先队列 求最小次最短路径)
- ajax异步请求刷新
- poj——1182食物链(并查集 每种动物扮演三种角色)