Sliding Window

最新推荐文章于 2019-03-09 22:58:38 发布

「已注销」

最新推荐文章于 2019-03-09 22:58:38 发布

阅读量806

点赞数

分类专栏：数据结构***************

本文链接：https://blog.csdn.net/bo_jwolf/article/details/12841293

版权

数据结构*************** 专栏收录该内容

60 篇文章 0 订阅

订阅专栏

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=34121#problem/G

// File Name: g.cpp
// Author: bo_jwolf
// Created Time: 2013年10月17日 星期四 15:33:34

#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>

using namespace std;
const int maxn = 1000005;
int num[ maxn ];
int temp[ maxn ], dis[ maxn ];
int main(){
	int n, m;
	int *beg = temp, *end = temp;
	while( scanf( "%d%d", &n, &m ) != EOF ){
		for( int i = 0; i < n; ++i )
			scanf( "%d", &num[ i ] );
		for( int i = 0; i < n; ++i ){
			end = lower_bound( beg, end, num[ i ] );
			*end = num[ i ];
			dis[ end - temp ] = i;
			++end;
			if( i - dis[ beg - temp ] >= m )
				++beg;
			if( i + 1 >= m )
				printf( "%d ", *beg );
		}
		puts( "" );
		beg = end = temp;
		for( int i = 0; i < n; ++i ){
			end = lower_bound( beg, end, num[ i ], greater< int >() );
			*end = num[ i ];
			dis[ end - temp ] = i;
			++end;
			if( i - dis[ beg - temp ] >= m )
				++beg;
			if( i + 1 >= m )
				printf( "%d ", *beg );
		}
	}
return 0;
}