HDU3530(单调队列)
来源:互联网 发布:unity3d粒子系统爆炸 编辑:程序博客网 时间:2024/05/21 08:58
Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6679 Accepted Submission(s): 2243
Problem Description
There is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum element of the subsequence is no smaller than m and no larger than k.
Input
There are multiple test cases.
For each test case, the first line has three integers, n, m and k. n is the length of the sequence and is in the range [1, 100000]. m and k are in the range [0, 1000000]. The second line has n integers, which are all in the range [0, 1000000].
Proceed to the end of file.
Output
For each test case, print the length of the subsequence on a single line.
Sample Input
5 0 0
1 1 1 1 1
5 0 3
1 2 3 4 5
Sample Output
5
4
题意:给你N个数,让你找出一个最长的连续子序列,这个子序列的最大值和最小值的差值介于m,k之间。
解题思路:用两个单调队列,一个维护最大值,一个维护最小值,当最大值与最小值的差值大于k时,考虑把最大值变小,或者把最小值变大,具体看最大值与最小值的位置关系。、
#include<bits/stdc++.h>using namespace std;const int maxn = 1e5 + 10;int qmax[maxn];//维护最大值的队列int qmin[maxn];//维护最小值的队列int lmax, rmax;int lmin, rmin;//l 表示队尾,r表示队首int n, m, k;int a[maxn];int ans;void init(){ lmax = lmin = 0; rmin = rmax = 0; ans = 0;}int main(){ while(~scanf("%d%d%d", &n, &m, &k)) { init(); for(int i = 1; i <= n; i++) { scanf("%d", &a[i]); } int l1 = 0; int l2 = 0; bool flag = false; for(int i = 1; i <= n; i++) { while(rmax > lmax && a[qmax[rmax - 1]] <= a[i]) rmax--; qmax[rmax++] = i; while(rmin > lmin && a[qmin[rmin - 1]] >= a[i]) rmin--; qmin[rmin++] = i; while(a[qmax[lmax]] - a[qmin[lmin]] > k) { if(qmax[lmax] > qmin[lmin]) l2 = qmin[lmin++]; else l1 = qmax[lmax++]; } if(a[qmax[lmax]] - a[qmin[lmin]] >= m && a[qmax[lmax]] - a[qmin[lmin]] <= k) { ans = max(ans,i - max(l1,l2)); flag = true; } } if(flag) printf("%d\n", ans); else printf("0\n"); } return 0;}
- HDU3530(单调队列)
- hdu3530(单调队列)
- hdu3530单调队列(双)
- hdu3530 Subsequence 单调队列
- hdu3530 Subsequence 单调队列
- hdu3530 Subsequence 单调队列
- hdu3530 Subsequence 单调队列
- hdu3530 Subsequence 单调队列
- hdu3530 Subsequence(单调队列)
- hdu3530单调队列
- #HDU3530#Subsequence(单调队列)
- hdu3530 Subsequence 单调队列
- hdu3530 单调队列
- HDU3530 单调队列的应用
- hdu3530——Subsequence(单调队列优化DP)
- hdu3530(最长连续子串+单调队列)
- 【HDU3530】【单调队列(双)】Subsequence 【长度为n的数列,求最长子区间的长度,使得区间的最大值与最小值的差满足一个范围】
- poj2823(单调队列队列)
- BZOJ 2152 聪聪可可
- Python 正则表达式 re模块
- tensorflow入门7 softmax函数和交叉熵损失函数
- RabbitMQ 常用命令
- 数据结构——队列——C++实现队列及其操作
- HDU3530(单调队列)
- LCS
- [学习笔记]Application用途
- java实现从上往下打印出二叉树的每个节点,同层节点从左至右打印。
- XCode里的模拟器到底在哪里?我的App被放到哪里了?程序员需要知道的XCODE相关路径
- Django 内建 中间件组件
- Navicat Premium for Mac 中文破解版
- opencv3 特征检测与匹配及寻找目标
- 二分查找非递归与递归实现