POJ 3061 Subsequence 尺取法附基础模板
来源:互联网 发布:淘宝上定制耳机的店铺 编辑:程序博客网 时间:2024/06/14 00:26
Subsequence
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15909 Accepted: 6728
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
[Submit] [Go Back] [Status] [Discuss]
传送门:http://poj.org/problem?id=3061
AC代码&&模板:
#include <cstdio>#include <algorithm>#include <cstring>const int INF =1000000;using namespace std;int a[100010];int n, t, ans = INF;int sum, s;int main(){ scanf("%d", &t); while (t--){ scanf("%d %d", &n, &s); for (int i = 0; i < n; i++) scanf("%d", a+i); int st = 0, en = 0; ans =INF ; sum = 0; while (1){ while (en<n && sum<s) sum += a[en++]; if (sum < s) break; ans = min(ans, en-st); sum -= a[st++]; } if (ans == INF) ans = 0; printf("%d\n", ans); } return 0;}
阅读全文
2 0
- POJ 3061 Subsequence 尺取法附基础模板
- 尺取法模板题 poj 3061 Subsequence
- 尺取法模板 【pascal】(附poj 3061&poj 2739)
- 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【尺取法】
- LintCode 解题记录17.8.4 字符串处理2
- Maven Web项目解决跨域问题
- sarg分析squid日志
- 方法数超过限制,Google官方解决方案链接:https://developer.android.com/studio/build/multidex.html
- Java中的https证书问题
- POJ 3061 Subsequence 尺取法附基础模板
- 云计算是过去式了,接下来是边缘计算的时代?
- JAVASCRIPT 面向对象编程(二)
- Unity解析gif动态图
- Retrofit2、okHttp3、RxAndroid使用
- 编写一个 JAVA 程序,实现输出考试成绩的前三名
- 示波器使用
- 带花树算法 UOJ#79. 一般图最大匹配
- oracle常用命令