(2012-05-02 23:23:54)
SOJ3139:http://cstest.scu.edu.cn/soj/problem.action?id=3139
这道题纯粹地利用双端对列。
代码:
#include<iostream>
#include<deque>
#include<cstring>
using namespace std;
struct node
{
int number;
int mark;
}s[1000005];
int main()
{
int n,k;
int i;
deque<node>q;
while(scanf("%d%d",&n,&k)==2)
{
for(i=1;i<=n;i++)
{
scanf("%d",&s[i].number);
s[i].mark=i;
}
for(i=1;i<k;i++)
{
while(!q.empty() && q.back().number>=s[i].number)
q.pop_back();
q.push_back(s[i]);
}
for(i=k;i<=n;i++)
{
while(!q.empty() && q.back().number>=s[i].number)
q.pop_back();
q.push_back(s[i]);
while(q.front().mark<i-k+1)
q.pop_front();
printf("%d ",q.front().number);
}
printf("\n");
while(!q.empty())
q.pop_front();
for(i=1;i<k;i++)
{
while(!q.empty() && q.back().number<=s[i].number)
q.pop_back();
q.push_back(s[i]);
}
for(i=k;i<=n;i++)
{
while(!q.empty() && q.back().number<=s[i].number)
q.pop_back();
q.push_back(s[i]);
while(q.front().mark<i-k+1)
q.pop_front();
printf("%d ",q.front().number);
}
printf("\n");
while(!q.empty())
q.pop_front();
}
return 0;
}