poj 2823 Sliding Window
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了poj 2823 Sliding Window相关的知识,希望对你有一定的参考价值。
Sliding Window
Time Limit: 12000MS Memory Limit: 65536K
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: Description
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 3
1 3 -1 -3 5 3 6 7
Sample Output
-1 -3 -3 -3 3 3
3 3 5 5 6 7
1 #include<cstdio> 2 using namespace std; 3 #define maxn 1000010 4 int a[maxn],q[maxn],head,tail,n,k; 5 int input() { 6 char c=getchar();int x=0,flag=1; 7 for(;c<‘0‘||c>‘9‘;c=getchar()) 8 if(c==‘-‘) flag=-1; 9 for(;c>=‘0‘&&c<=‘9‘;c=getchar()) 10 x=x*10+c-‘0‘; 11 return x*flag; 12 } 13 void Get_Min() { 14 head=0,tail=0; 15 for(int i=1;i<=n;i++) { 16 for(;head<=tail&&a[q[tail]]>=a[i];tail--); 17 q[++tail]=i; 18 for(;q[head]<=i-k&&head<tail;head++); 19 if(i>=k) printf("%d ",a[q[head]]); 20 } 21 printf("\n"); 22 } 23 void Get_Max() { 24 head=0,tail=0; 25 for(int i=1;i<=n;i++) { 26 for(;head<=tail&&a[q[tail]]<=a[i];tail--); 27 q[++tail]=i; 28 for(;q[head]<=i-k&&head<tail;head++); 29 if(i>=k) printf("%d ",a[q[head]]); 30 } 31 } 32 int main() { 33 n=input();k=input(); 34 for(int i=1;i<=n;i++) 35 a[i]=input(); 36 Get_Min(),Get_Max(); 37 return 0; 38 }
以上是关于poj 2823 Sliding Window的主要内容,如果未能解决你的问题,请参考以下文章