单调队列 hdu2823
2015-09-17 20:39
204 查看
Sliding Window
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.
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
Sample Output
View Code
Time Limit: 12000MS | Memory Limit: 65536K | |
Total Submissions: 48608 | Accepted: 14047 | |
Case Time Limit: 5000MS |
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 | -1 | 3 |
1 [3 -1 -3] 5 3 6 7 | -3 | 3 |
1 3 [-1 -3 5] 3 6 7 | -3 | 5 |
1 3 -1 [-3 5 3] 6 7 | -3 | 5 |
1 3 -1 -3 [5 3 6] 7 | 3 | 6 |
1 3 -1 -3 5 [3 6 7] | 3 | 7 |
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 3 1 3 -1 -3 5 3 6 7
Sample Output
-1 -3 -3 -3 3 3 3 3 5 5 6 7
#include <stdio.h> #include <string.h> #include <queue> #include <algorithm> using namespace std; int a[1000005],q[1000005],p[1000005],mi[1000005],ma[1000005]; int n,k; void get_min() { int i,j; int head=1,tail=0; for(i=0;i<k-1;i++) { while(head<=tail && q[tail]>=a[i]) tail--; q[++tail]=a[i]; p[tail]=i; } for(;i<n;i++) { while(head<=tail && q[tail]>=a[i]) tail--; q[++tail]=a[i]; p[tail]=i; while(p[head]<i-k+1) { head++; } mi[i-k+1]=q[head]; } } void get_max() { int i,j; int head=1,tail=0; for(i=0;i<k-1;i++) { while(head<=tail && q[tail]<=a[i]) tail--; q[++tail]=a[i]; p[tail]=i; } for(;i<n;i++) { while(head<=tail && q[tail]<=a[i]) tail--; q[++tail]=a[i]; p[tail]=i; while(p[head]<i-k+1) head++; ma[i-k+1]=q[head]; } } int main() { int i,j; scanf("%d %d",&n,&k); for(i=0;i<n;i++) { scanf("%d",&a[i]); } get_max(); get_min(); for(i=0;i<n-k;i++) { printf("%d ",mi[i]); } printf("%d\n",mi[n-k]); for(i=0;i<n-k;i++) { printf("%d ",ma[i]); } printf("%d\n",ma[n-k]); return 0; }
View Code
相关文章推荐
- SDUTOJ3309----乱七八糟的图
- 命令支持管道
- poj 1330
- 通过inotify监控linux文件系统变化
- <meta>标签
- 雨林木风Win10怎么关闭管理员账户?Win10启用关闭管理员账户方法
- 世界时区表
- 项目四——(2)
- 趣写算法系列之--匈牙利算法
- javascript事件
- QQ主界面的滑动效果的实现(xml中定义布局属性)
- java 不寻常的问题 No bean named 'sessionFactory' is defined 和 initialize a collection of role
- HDU---5441-Travel(并查集)(2015 Changchun)
- HDU 2102 A计划
- 0917Android基础自定义View(Path)
- swift 日历练习
- ios9键盘回调与消息通知,理论上应该是个bug
- 大话移动app测试_阅读
- 以树形结构的形式输出指定目录下面的所有文件
- 优秀IT技术文章集(最新)(高质量)