尺取法模板题 poj 3061 Subsequence
来源:互联网 发布:宏盟媒体集团 知乎 编辑:程序博客网 时间:2024/05/17 09:20
Subsequence
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12570 Accepted: 5299
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 <stdio.h>#include <string.h>#include <math.h>#include <algorithm>#include <iostream>using namespace std; int a[100010]; void solve() { int q; scanf("%d",&q); while(q--) { int n,S; scanf("%d%d",&n,&S); memset(a,0,sizeof(a)); for(int i=0;i<n;i++) scanf("%d",&a[i]); int res=n+1; int s,t,sum; s=t=sum=0; while(1) { while(sum<S) { sum+=a[t++]; if(t>=n)break; } if(sum<S)break; res=res>(t-s)?(t-s):res; sum-=a[s++]; } if(res>n)printf("0\n"); else printf("%d\n",res); } }int main(){ solve(); 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 尺取法
- 157.Unique Characters-判断字符串是否没有重复字符(容易题)
- 多线程Demo
- css样式基础之样式的引入
- Mantle简介
- JavaScript正则表达式
- 尺取法模板题 poj 3061 Subsequence
- java练习---AutoLion
- 兼容IE6+、Chrome、FireFox的固定浮动css代码
- 【HackerRank】Fair Cut(DP)
- github oc框架排名列表
- 让Eclipse的TomcatPlugin支持Tomcat 8.x
- 循环语句基本结构及应用
- 侧滑菜单的简单实现方式
- nginx+tomcat+JDK 实例