题目大意:给n个数字,求长度为k的数字串中最大最小值。
题目分析:用2个单调队列分别维护最大值和最小值。单调队列入门题,废话不多说。详情请见代码:
#include <iostream>
#include<cstdio>
using namespace std;
const int N = 1000005;
int lcm[N];
int mx[N],mn[N];
int mxnum,mnnum;
int n,k;
struct node1
{
int array[N];
int head,tail;
int i;
void init()
{
head = 0;
tail = -1;
}
int top()
{
return array[head];
}
void push(int t)
{
while(head <= tail && lcm[array[tail]] <= lcm[t])
tail --;
array[++tail] = t;
}
void pop(int t)
{
if(array[head] <= t - k)
head ++;
mx[mxnum ++] = lcm[array[head]];
}
}q1;
struct node2
{
int array[N];
int head,tail;
int i;
void init()
{
head = 0;
tail = -1;
}
int top()
{
return array[head];
}
void push(int t)
{
while(head <= tail && lcm[array[tail]] >= lcm[t])
tail --;
array[++tail] = t;
}
void pop(int t)
{
if(array[head] <= t - k)
head ++;
mn[mnnum ++] = lcm[array[head]];
}
}q2;
int main()
{
int i;
while(scanf("%d%d",&n,&k) != EOF)
{
for(i = 0;i < n;i ++)
scanf("%d",&lcm[i]);
q1.init();
q2.init();
mxnum = mnnum = 0;
for(i = 0;i < k - 1;i ++)
{
q1.push(i);
q2.push(i);
}
for(i = k - 1;i < n;i ++)
{
q1.push(i);
q1.pop(i);
q2.push(i);
q2.pop(i);
}
for(i = 0;i < mnnum - 1;i ++)
printf("%d ",mn[i]);
printf("%d\n",mn[i]);
for(i = 0;i < mxnum - 1;i ++)
printf("%d ",mx[i]);
printf("%d\n",mx[i]);
}
return 0;
}
//10976K 5422MS