首页 > 代码库 > poj 2823
poj 2823
Sliding Window
| Time Limit: 12000MS | Memory Limit: 65536K | |
| Total Submissions: 40443 | Accepted: 11950 | |
| Case 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.
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 |
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<string>#include<cmath>#include<queue>#include<cstdlib>#include<vector>#include<set>#include<queue>using namespace std;int a[1000000];int aa[1000000];int bb[1000000];int n,s;struct cmp1{ bool operator()(const int a1,const int a2) { return a[a1]>a[a2]; }};struct cmp2{ bool operator()(const int a1,const int a2) { return a[a1]<a[a2]; }};priority_queue<int,vector<int>,cmp1>q1;priority_queue<int,vector<int>,cmp2>q2;int main(){ scanf("%d%d",&n,&s); int i,cnt1=0,cnt2=0; for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;i<s;i++) { q1.push(i); q2.push(i); } aa[cnt1++]=a[q1.top()]; bb[cnt2++]=a[q2.top()]; for(i=s;i<n;i++) { q1.push(i); q2.push(i); while(i-q1.top()>=s) q1.pop(); aa[cnt1++]=a[q1.top()]; while(i-q2.top()>=s) q2.pop(); bb[cnt2++]=a[q2.top()]; } printf("%d",aa[0]); for(i=1;i<n-s+1;i++) printf(" %d",aa[i]); printf("\n"); printf("%d",bb[0]); for(i=1;i<n-s+1;i++) printf(" %d",bb[i]); printf("\n"); return 0;}
poj 2823
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。