【POJ】2061 - Subsequence(STL & 二分)
来源:互联网 发布:淘宝买组装机 编辑:程序博客网 时间:2024/05/22 00:36
点击打开题目
Subsequence
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11797 Accepted: 4949
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
题意:给出n个数和一个S,求这 n 个数的子序列大于等于 S 的最短序列长度是多少。
题解:求出当 i 为之前面所有数的和。然后从最后一个数开始,找出第一个满足条件的数的位置,求之间的距离更新 ans 值,最后得出最短的 ans 。
代码如下:
#include <cstdio>#include <algorithm>#define MAX 100000using namespace std;int main(){int u;int sum[MAX+22];int ans;int n,S;scanf ("%d",&u);while (u--){scanf ("%d %d",&n,&S);scanf ("%d",&sum[0]);for (int i = 1 ; i < n ; i++){scanf ("%d",&sum[i]);sum[i] += sum[i-1];}if (sum[n-1] < S){printf ("0\n");continue;}ans = n;int pos;//存放序列开始的位置 for (int i = n - 1 ; i >= 0 ; i--)//从最后面开始,把其当作序列尾 {if (sum[i] < S)break;pos = upper_bound(sum , sum + n , sum[i] - S) - sum;ans = min(ans , i - pos + 1);}printf ("%d\n",ans);}return 0;}
0 0
- 【POJ】2061 - Subsequence(STL & 二分)
- 【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-2533 Longest Ordered Subsequence(二分)
- Poj 3061 Subsequence(二分+前缀和)
- poj 3061 Subsequence(二分,尺取法)
- POJ 3061 · Subsequence【子序列】【二分】
- POJ 3061-Subsequence(尺取法,二分)
- poj 2002 Squares 【stl二分】
- Poj 2002 Squares(二分&&STL)
- HDU 3530 Subsequence(STL)
- POJ 2503 Babelfish(STL、二分、字典树、哈希)
- 去掉WebView中的白色背景
- 在php中定义常量时,const与define的区别
- Linux下JDK、Tomcat的安装及配置
- 用 Python 排序数据的多种方法
- Android中 网络框架Volley的用法
- 【POJ】2061 - Subsequence(STL & 二分)
- MongoDB 数据导入 mongoimport
- Warning: Permanently added 'git.coding.net,222.186.133.56' (RSA) to the list of known hosts.解决笔记
- Java Executor 框架
- C程序的编译过程
- javaweb获取ApplicationContext对象
- python 数据类型总结之列表(二(3))
- Redis常见集群对比
- Java5新特征之foreach语句使用总结