POJ 2823

最新推荐文章于 2021-07-19 16:33:52 发布

MyFishedee

最新推荐文章于 2021-07-19 16:33:52 发布

阅读量540

点赞数

分类专栏：栈和队列文章标签： c

本文链接：https://blog.csdn.net/MyFishedee/article/details/6559456

版权

栈和队列专栏收录该内容

20 篇文章

订阅专栏

单调队列入门，

单调队列与单调栈都很有意思啊。。。我喜欢

C++能过

#include <cstdio> using namespace std; const int MAX = 10000100; int data[MAX]; int min[MAX]; int max[MAX]; int queue[MAX]; int qbegin,qend,n,k; void findmin() { qbegin = qend = 0 ; for( int i = 0 ; i != n ; ++i ) { while( qbegin != qend && data[ queue[ qend - 1 ] ] >= data[ i ] ) --qend; queue[ qend ++ ] = i; while( qbegin != qend && queue[ qbegin ] < i - k + 1 ) ++qbegin; min[ i ] = data[ queue[ qbegin ] ]; } } void findmax() { qbegin = qend = 0 ; for( int i = 0 ; i != n ; ++i ) { while( qbegin != qend && data[ queue[ qend - 1 ] ] <= data[ i ] ) --qend; queue[ qend ++ ] = i; while( qbegin != qend && queue[ qbegin ] < i - k + 1 ) ++qbegin; max[ i ] = data[ queue[ qbegin ] ]; } } int main() { scanf("%d%d",&n,&k); for( int i = 0 ; i != n ; ++i ) scanf("%d",&data[i]); findmin(); findmax(); printf("%d",min[k-1]); for( int i = k; i < n ; ++i ) printf(" %d",min[i]); printf("/n"); printf("%d",max[k-1]); for( int i = k; i < n ; ++i ) printf(" %d",max[i]); printf("/n"); return 0; }