ural 1126. Magnetic Storms

#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;

struct Node
{
int id,val;
};

int main()
{
int n,ncase=1;
Node node;
deque<Node> dq;
while(scanf("%d",&n)==1&&n>0)
{
dq.clear();
int cnt=0;
while(scanf("%d",&node.val) && node.val>-1)
{
node.id=cnt++;

while(!dq.empty() && dq.front().id < cnt-n)
dq.pop_front();
while(!dq.empty() && dq.back().val < node.val)
dq.pop_back();
dq.push_back(node);
if(cnt>=n)
printf("%d\n",dq.front().val);
}
}
return 0;
}