[luoguP1866]滑动窗口（单调队列）

传送门

可以搞2个单调队列。

然后，然后就没有然后了。

 # include <iostream>
 # include <cstdio>
 # include <cstring>
 # include <string>
 # include <cmath>
 # include <vector>
 # include <map>
 # include <queue>
 # include <cstdlib>
 # define MAXN
 using namespace std;

 inline int get_num() {
     int k = , f = ;
     char c = getchar();
     for(; !isdigit(c); c = getchar()) if(c == '-') f = -;
     for(; isdigit(c); c = getchar()) k = k *  + c - '';
     return k * f;
 }

 int n, k, h1 = , t1, h2 = , t2;
 int a[MAXN], q1[MAXN], q2[MAXN], ans1[MAXN], ans2[MAXN];

 int main()
 {
     int i;
     n = get_num();
     k = get_num();
     for(i = ; i <= n; i++) a[i] = get_num();
     for(i = ; i <= n; i++)
     {
         while(h1 <= t1 && q1[h1] < i - k + ) h1++;
         while(h2 <= t2 && q2[h2] < i - k + ) h2++;
         while(h1 <= t1 && a[q1[t1]] > a[i]) t1--;
         q1[++t1] = i;
         while(h2 <= t2 && a[q2[t2]] < a[i]) t2--;
         q2[++t2] = i;
         ans1[i] = a[q1[h1]];
         ans2[i] = a[q2[h2]];
     }
     for(i = k; i <= n; i++) printf("%d ", ans1[i]);
     puts("");
     for(i = k; i <= n; i++) printf("%d ", ans2[i]);
     puts("");
     return ;
 }

完全临摹黄学长代码2333