首页 > 代码库 > POJ 2838 单调队列

POJ 2838 单调队列

2024-08-15 03:44:52   224人阅读

Sliding Window
Time Limit: 12000MS Memory Limit: 65536K
Total Submissions: 55309 Accepted: 15911
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.
Window positionMinimum valueMaximum 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

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
题意：
N个数一串，一个长度为K的窗口，窗口开始在最左边，每次向右移动一格，问每次窗口内最大值和最小值。
代码：
基本单调队列
 1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 using namespace std; 5 int n,k; 6 int a[1000005]; 7 int ddq[1000005]; 8 void min() 9 {10     int head=1,tail=0;11     for(int i=0;i<k-1;i++)12     {13         while(head<=tail&&a[ddq[tail]]>=a[i])14         tail--;15         tail++;16         ddq[tail]=i;17     }18     for(int i=k-1;i<n;i++)19     {20         while(head<=tail&&a[ddq[tail]]>=a[i])21         tail--;22         tail++;23         ddq[tail]=i;24         while(ddq[head]<i-k+1)25         head++;26         printf("%d",a[ddq[head]]);27         if(i==n-1) printf("\n");28         else printf(" ");29 30     }31 }32 void max()33 {34     int head=1,tail=0;35     for(int i=0;i<k-1;i++)36     {37         while(head<=tail&&a[ddq[tail]]<=a[i])38         tail--;39         tail++;40         ddq[tail]=i;41     }42     for(int i=k-1;i<n;i++)43     {44         while(head<=tail&&a[ddq[tail]]<=a[i])45         tail--;46         tail++;47         ddq[tail]=i;48         while(ddq[head]<i-k+1)49         head++;50         printf("%d",a[ddq[head]]);51         if(i==n-1)52         printf("\n");53         else printf(" ");54     }55 }56 int main()57 {58     while(scanf("%d%d",&n,&k)!=EOF)59     {60         memset(ddq,0,sizeof(ddq));61         memset(a,0,sizeof(a));62         for(int i=0;i<n;i++)63         scanf("%d",&a[i]);64         min();65         max();66     }67     return 0;68 }

 

POJ 2838 单调队列


联系
我们