POJ2823

Sliding Window

                 Time Limit: 12000MS             Memory Limit: 65536K
                Total Submissions: 20827    Accepted: 6095
                          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.Your task is to determine the maximum and minimum values in:

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

Source

POJ Monthly--2006.04.28, Ikki

 

 

我用传说中的线段树做出来了，想当年用单调队列刷了半天没过。

 

 

 

/* ID: lx99410 Problem:POJ P2823 http://poj.org/problem?id=2823 Time Limit:5000MS Memory Limit:65536K Judeg Result | Memory | Time Used | Code Length | Language Accepted | 52052K | 7063ms | 2012B | C++ */ #include<stdio.h> #include<iostream> using namespace std; const int maxn=1000011; struct Node{ int l,r,root,min,max; }tree[maxn*5]; int minl[maxn],maxl[maxn],a[maxn],k,len; void build(int l,int r,int root){ tree[root].l=l; tree[root].r=r; if(l==r){ tree[root].min=tree[root].max=a[l]; return; } int mid=(l+r)>>1; build(l,mid,root*2); build(mid+1,r,root*2+1); tree[root].min=min(tree[root*2].min,tree[root*2+1].min); tree[root].max=max(tree[root*2].max,tree[root*2+1].max); } bool init(){ if(scanf("%d",&k)==EOF)return false; scanf("%d",&len); for(int i=1;i<=k;i++)scanf("%d",&a[i]); build(1,k,1); return true; } void query(int l,int r,int &min,int &max,int root){ if(tree[root].l==l&&tree[root].r==r){ min=tree[root].min; max=tree[root].max; return; } int mid=(tree[root].l+tree[root].r)>>1; if(mid>=r)query(l,r,min,max,root*2); else if(mid<l)query(l,r,min,max,root*2+1); else{ int max2,min2; query(l,mid,min,max,root*2); query(mid+1,r,min2,max2,root*2+1); min=min<min2?min:min2; max=max>max2?max:max2; } } void work(){ int ans1,ans2,i; for(i=1;i<=k-len+1;i++){ query(i,i+len-1,ans2,ans1,1); minl[i]=ans2; maxl[i]=ans1; } } void print(){ int i; for(i=1;i<=k-len+1;i++)printf("%d ",minl[i]); putchar('/n'); for(i=1;i<=k-len+1;i++)printf("%d ",maxl[i]); putchar('/n'); } int main(){ while(init()){ work(); print(); } return 0; }

 

 

传说中的单调队列：

#include<stdio.h> #include<iostream> using namespace std; const int maxn=1000001; int min_1[maxn],max_1[maxn],a[maxn],n,k; void init(){ scanf("%d",&k); for(int i=1;i<=n;i++)scanf("%d",&a[i]); } void get_max(){ int i,j,start=1,end=1; for(i=1;i<k;i++){ while(a[max_1[end]]<a[i]&&end>=start)end--; end++; max_1[end]=i; } for(i=k;i<=n;i++){ while(max_1[start]<=i-k&&start<=end)start++; while(a[max_1[end]]<a[i]&&end>=start)end--; end++; max_1[end]=i; if(i!=n)printf("%d ",a[max_1[start]]); } printf("%d/n",a[max_1[start]]); } void get_min(){ int i,j,start=1,end=1; for(i=1;i<k;i++){ while(a[min_1[end]]>a[i]&&end>=start)end--; end++; min_1[end]=i; } for(i=k;i<=n;i++){ while(min_1[start]<=i-k&&start<=end)start++; while(a[min_1[end]]>a[i]&&end>=start)end--; end++; min_1[end]=i; if(i!=n)printf("%d ",a[min_1[start]]); } printf("%d/n",a[min_1[start]]); } void work(){ get_min(); get_max(); } int main(){ while(cin>>n){ init(); work(); } return 0; }

 

 

马上还用个优先队列做个，嘿嘿.