poj3061(二分前缀和或者尺取法)
来源:互联网 发布:浙江网络干部学院金华 编辑:程序博客网 时间:2024/06/06 09:02
题目:
Subsequence
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 11977 Accepted: 5015
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
2
10 15
5 1 3 5 10 7 4 9 2 8
5 11
1 2 3 4 5
Sample Output
2
3
题意:
给一个数列,和一个数s,求数列中最少需要几个数相加得s,可以不连续。
思路一:
二分前缀和,在满足arr[high]-arr[low]>=s这个区间内,二分寻找一个大于等于arr[low]+s的arr[tmp_ans],并且能计算区间长度,那么取所有满足条件的最小值即可。
代码如下:
#include <iostream>#include <cstring>#include <algorithm>const int maxn = 100000+10;int arr[maxn];using namespace std;int main(){ int t, n, s; cin>>t; while(t--){ cin>>n>>s; memset(arr, 0, sizeof(arr)); arr[0]=0; for(int i=1; i<=n; i++){ cin>>arr[i]; arr[i] = arr[i-1]+arr[i]; } if(arr[n]<s) {cout<<0<<endl; continue;} int cnt = s+10; int low, high; for(int i=0; arr[n]-arr[i]>=s; i++){ low = i; high = n; while(low<=high){ int mid = (low+high)/2; if(arr[mid]>=s+arr[i]) high = mid - 1; else low = mid + 1; } cnt = min(cnt, low-i); } cout<<cnt<<endl; } return 0;}
思路2:
尺取法。这个解法我看的这个博客:http://blog.csdn.net/yew1eb/article/details/38776647
我重敲了一遍这个博主的代码,我自己的理解也写在里面了,不重复写了。
#include <iostream>#include <algorithm>#include <cstring>const int maxn = 100000+10;int arr[maxn];using namespace std;int main(){ int t, n, s; cin>>t; while(t--){ cin>>n>>s; int ans = s+10; for(int i=1; i<=n; i++) cin>>arr[i]; //head表示尺子头,tmp表示尺子长度,cnt计数并且为尺子尾所在 int head=1, cnt=1, tmp=0; while(1){ //生成尺子(或移动尺子) while(cnt<=n&&tmp<s){ tmp += arr[cnt]; cnt++; } //如果生不成尺子,那么结束 if(tmp<s) break; ans = min(ans, cnt-head); //将尺子缩短,满足题目尽量小的需要 tmp -= arr[head++]; } //处理输出 if(ans<=n) cout<<ans<<endl; else cout<<0<<endl; } return 0;}
- poj3061(二分前缀和或者尺取法)
- POJ3061 Subsequence(二分前缀和法+尺取法)
- POJ3061 ZOJ3123 Subsequence【前缀和+二分搜索+尺取法】
- POJ3061尺取法和二分法
- la2678(前缀和,二分/尺取法)
- POJ - 3061 Subsequence(前缀和+二分和尺取法)
- poj3061 Subsequence 尺取法
- poj3061 Subsequence ,尺取法
- poj3061 尺取法
- 尺取法 poj3061 poj3320
- [尺取法] poj3061 Subsequence
- POJ3061 Subsequence 尺取法
- 尺取法 poj3061
- poj3061(尺取法)
- POJ3061 尺取法
- POJ3061-Subsequence【尺取法】
- poj3061 Subsequence 尺取法
- poj3061 Subsequence 尺取法
- Linux常用命令-权限管理
- iOS之地图的使用和实时描绘运动轨迹
- 嵌入式学习-linux系统-lesson1-Uboot相关
- Android提高第十一篇之模拟信号示波器
- android 获取url 参数值
- poj3061(二分前缀和或者尺取法)
- Leetcode 13. Roman to Integer (Easy) (cpp)
- 关于 Akka actor中使用 slf4j日志的问题
- PHP特性01:cURL实现get和post,在url间做数据交互;
- 三层交换机和二层交换机的区别 如何选择第三层交换机
- UIScrollView 探究
- Java-----Apache Commons Codec
- 如何更改eclipse的 Explorer的字体大小
- c++指针的自我理解