POJ 3061 Subsequence (尺取法)
来源:互联网 发布:东方快车翻译软件 编辑:程序博客网 时间:2024/05/16 19:52
Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7604Accepted: 2879
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
附:
#include <iostream>#include <string>#include <string.h>#include <map>#include <stdio.h>#include <algorithm>#include <queue>#include <vector>#include <math.h>#include <set>#define Max(a,b) ((a)>(b)?(a):(b))#define Min(a,b) ((a)<(b)?(a):(b))#define Max_N 100008#define Max_S 100000008 using namespace std;int g_N, g_S;int g_Seq[Max_N]; int FindSubsequence(){ int res = g_N + 1; int left = 1, right = 1, sum = 0; while(1){ while(right <= g_N&&sum < g_S){ sum += g_Seq[right++]; } if(sum < g_S) break; res = Min(res , right - left); sum -= g_Seq[left++]; } return res > g_N?0:res;}int main(){ int test; cin>>test; while(test--){ scanf("%d%d",&g_N,&g_S); for(int i = 1;i <= g_N;i++){ scanf("%d",&g_Seq[i]); } printf("%d\n",FindSubsequence()); } return 0;}
- 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(尺取法)
- poj 3061 Subsequence(尺取法)
- POJ 3061 Subsequence ( 尺取法 )
- POJ 3061 Subsequence(尺取法)
- Poj 3061 Subsequence【尺取法】
- JVM 性能优化, Part 4: C4 垃圾回收
- AndroidManifest.xml 详解
- U盘文件或目录损坏且无法读取
- oracle的一个简单的存储过程
- JVM性能优化, Part 5:Java的伸缩性
- POJ 3061 Subsequence (尺取法)
- jQuery-强大的jQuery选择器 (详解)[转]
- 1.开始学习本体
- eclipse配置jetty的两种方法
- 高通 AR Unity 虚拟按钮
- 字符串编码转换(GBK) NSString, char, NSData相互转化 从 GBK 转到&nb
- Qt 使用json的一些笔记
- iOS 实现渐变色
- 用proxool连接池关闭连接注意事项