POJ 2823 Sliding Window
来源:互联网 发布:c语言输出星号金字塔 编辑:程序博客网 时间:2024/05/17 02:34
Sliding Window
Time Limit: 12000MS Memory Limit: 65536KTotal Submissions: 58579 Accepted: 16778Case 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 <cstring>#include <algorithm>#include <deque>#include <vector>using namespace std;const int maxn = 1000000 + 5;int mmax[maxn];int mmin[maxn];int a[maxn];int n,k;struct node{ int key; int value;}vis[maxn];int MAX[maxn],MIN[maxn];int n,k;deque<node> q1,q2;void _min(){ for(int i=1;i<=n;++i) { while(!q1.empty()) { if(q1.back().value > vis[i].value) q1.pop_back(); else break; } q1.push_back(vis[i]); while(!q1.empty()) { if(q1.front().key<i-k+1) q1.pop_front(); else break; } MIN[i]=q1.front().value; }}void _max(){ for(int i=1;i<=n;++i) { while(!q2.empty()) { if(q2.back().value < vis[i].value) q2.pop_back(); else break; } q2.push_back(vis[i]); while(!q2.empty()) { if(q2.front().key<i-k+1) q2.pop_front(); else break; } MAX[i]=q2.front().value; }}int main(){ cin>>n>>k; for(int i=1;i<=n;++i) { cin>>vis[i].value; vis[i].key=i; } _min(); _max(); for(int i=k;i<n;++i) { cout<<MIN[i]<<" "; } cout<<MIN[n]<<endl; for(int i=k;i<n;++i) { cout<<MAX[i]<<" "; } cout<<MAX[n]<<endl; return 0;}
0 0
- POJ 2823 Sliding Window
- poj 2823 Sliding Window
- poj 2823 Sliding Window
- POJ 2823 Sliding Window
- POJ-2823-Sliding Window
- POJ 2823 Sliding Window
- POJ 2823 Sliding Window
- POJ 2823 Sliding Window
- poj 2823 Sliding Window
- POJ 2823(Sliding Window)
- POJ-2823-Sliding Window
- poj 2823 Sliding Window
- POJ 2823 Sliding Window
- POJ 2823 Sliding Window
- Sliding Window poj 2823
- POJ 2823 Sliding Window
- poj 2823 Sliding Window
- POJ 2823 Sliding Window
- 单调递增最长子序列
- 浅析java中BigDecimal大数值类的使用
- poj A Bug's Life(关系并查集)
- AndroidStudio安装报错
- opencv 颜色识别
- POJ 2823 Sliding Window
- HDU 2073 JAVA
- 高精度幂的计算
- sdutacm-最短路径问题
- JAVA类型转换
- LeetCode 240. Search a 2D Matrix II
- DFS和BFS的使用
- while循环,习题33,笨办法学python
- sdutacm-C--最短路