poj 2823 单调队列 deque写法
来源:互联网 发布:天猫打印发货单软件 编辑:程序博客网 时间:2024/05/18 04:01
Sliding Window
Time Limit: 12000MS Memory Limit: 65536KTotal Submissions: 46435 Accepted: 13417Case Time Limit: 5000MS
Description
An array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves rightwards by one position. Following is an example:
The array is [1 3 -1 -3 5 3 6 7], and k is 3.Window position Minimum value Maximum value [1 3 -1] -3 5 3 6 7 -13 1 [3 -1 -3] 5 3 6 7 -33 1 3 [-1 -3 5] 3 6 7 -35 1 3 -1 [-3 5 3] 6 7 -35 1 3 -1 -3 [5 3 6] 7 36 1 3 -1 -3 5 [3 6 7]37
The array is [1 3 -1 -3 5 3 6 7], and k is 3.
Your task is to determine the maximum and minimum values in the sliding window at each position.
Input
The input consists of two lines. The first line contains two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line.
Output
There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values.
Sample Input
8 31 3 -1 -3 5 3 6 7
Sample Output
-1 -3 -3 -3 3 33 3 5 5 6 7
Source
POJ Monthly--2006.04.28, Ikki
#include <iostream>#include <cstdio>#include <queue>#include <deque>using namespace std;typedef pair<int, int> P;#define maxn 1000000 + 10deque<P> Q1;deque<P> Q2;int n, k;int Min[maxn], Max[maxn];int main(){ while(~scanf("%d%d", &n, &k)) { while(!Q1.empty()) Q1.pop_back(); while(!Q2.empty()) Q2.pop_back(); int x; for(int i=1; i<=n; i++) { scanf("%d", &x); while(!Q1.empty() && Q1.back().first >= x) Q1.pop_back(); Q1.push_back(P(x, i)); if(i >= k) { while(!Q1.empty() && Q1.front().second <= i-k) Q1.pop_front(); Min[i] = Q1.front().first; } while(!Q2.empty() && Q2.back().first <= x) Q2.pop_back(); Q2.push_back(P(x, i)); if(i >= k) { while(!Q2.empty() && Q2.front().second <= i-k) Q2.pop_front(); Max[i] = Q2.front().first; } } for(int i=k; i<=n; i++) i == n ? printf("%d\n", Min[i]) : printf("%d ", Min[i]); for(int i=k; i<=n; i++) i == n ? printf("%d\n", Max[i]) : printf("%d ", Max[i]); } return 0;}
1 0
- poj 2823 单调队列 deque写法
- POJ 2823单调队列 数组写法
- 单调队列学习小记 Poj 2823 + Hdu 3530 (deque)
- 单调队列及其deque写法 HDU 3415+Poj 4002 (日期处理) + 合并果子
- 单调队列+STL deque
- Poj 2823 (单调队列)
- poj 2823【单调队列】
- POJ 2823 单调队列
- POJ-2823单调队列
- POJ 2823 单调队列
- poj 2823 单调队列
- 单调队列 POJ 2823
- poj 2823 单调队列
- POJ 2823 单调队列
- poj 2823 单调队列
- poj 2823 单调队列
- POJ 2823 单调队列
- poj 2823 单调队列
- 管理经验分享会议记录--【管理经验】
- 撒娇女人最好命 --电影名
- Mysqli :multi->query
- hadoop2.4.1伪分布式搭建
- shell语法简介
- poj 2823 单调队列 deque写法
- 有太多的东西要学
- #1127 : 二分图三·二分图最小点覆盖和最大独立集
- HDU 4772 Zhuge Liang's Password (简单模拟题)
- 项目加载不进去tomcat
- Complaints for Summer Vacation
- TOMCAT多站点配置
- wminotify.dll 病毒清理方法
- gsp页面标签