【单调队列】POJ_2823 Sliding Window
来源:互联网 发布:安装ubuntu后无法上网 编辑:程序博客网 时间:2024/06/10 10:31
Sliding Window
Time Limit: 12000MS Memory Limit: 65536KTotal Submissions: 61189 Accepted: 17511Case 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
/*求最大值维护一个单调递减的队列,栈存元素下标如果队列左边元素<i-2 出队列求最小值同理*/#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=1e6+10;int a[maxn],q[maxn],ans[maxn],ans1[maxn];int main(){ int n,k; scanf("%d%d",&n,&k); int front=0,rear=0; for(int i=0;i<n;i++){ scanf("%d",&a[i]); while(front<rear&&a[i]>a[q[rear-1]]) rear--; q[rear++]=i; while(front<rear&&q[front]<i-k+1) front++; ans[i]=a[q[front]]; } front=rear=0; for(int i=0;i<n;i++){ while(front<rear&&a[i]<a[q[rear-1]]) rear--; q[rear++]=i; while(front<rear&&q[front]<i-k+1) front++; ans1[i]=a[q[front]]; } for(int i=k-1;i<n;i++) printf(i==k-1?"%d":" %d",ans1[i]); printf("\n"); for(int i=k-1;i<n;i++) printf(i==k-1?"%d":" %d",ans[i]); printf("\n"); return 0;}
阅读全文
0 0
- 【单调队列】POJ_2823 Sliding Window
- Sliding Window(单调队列)
- poj_2823(单调队列)
- 2823 Sliding Window //单调队列
- DP:单调队列:Sliding Window
- Sliding Window poj2823--单调队列
- POJ2823 Sliding Window单调队列
- POJ2823 Sliding Window(单调队列)
- POJ2823 Sliding Window(单调队列)
- 单调队列 poj2823 Sliding Window
- POJ2823 Sliding Window(单调队列)
- 【POJ2823】Sliding Window-单调队列
- poj2823 Sliding Window 单调队列
- poj2823 Sliding Window 单调队列
- [POJ2823]Sliding Window(单调队列)
- [POJ2823]Sliding Window(单调队列)
- Sliding Window (单调队列)
- Sliding Window (单调队列)
- Android ParseXML 和 parseJson
- mysql引擎
- Android之XML解析(Pull)
- 一分钟上手SpringMVC(思维图)
- 由图片的网络地址获取图片的base64编码
- 【单调队列】POJ_2823 Sliding Window
- 【数据】Marvell 88W8782 WiFi模块的固件数据
- hdu 2015 偶数求和
- 常见基础排序算法总结及java代码
- RSA
- Linux下用户组、文件权限详解
- 集群之RHCS
- leetcode(34). Search for a Range
- 关于在anaconda下安装selenium后import报错问题