POJ 2823 Sliding Window 双端队列 or RMQ or 线段树

本来是道双端队列的题，结果我用RMQ水过

待会再看看双端队列的解法吧，反正这俩我都不会。。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#define min(a,b) (a)<(b)?(a):(b)
#define max(a,b) (a)>(b)?(a):(b)
using namespace std;
const int MAX = 1e6 + 5;
int a[MAX];
int dpmin[MAX], dpmax[MAX];
int n, k, m;

void RMQ_init(){
    for(int i = 0; i < n; ++i)
        dpmin[i] = dpmax[i] = a[i];
    for(int j = 1; j <= k; ++j)
        for(int i = 0; i + (1 << j) - 1 < n; ++i){
            dpmin[i] = min(dpmin[i], dpmin[i + (1 << (j - 1))]);
            dpmax[i] = max(dpmax[i], dpmax[i + (1 << (j - 1))]);
        }
}

int RMQ(int l, int r, int flag){
    if(flag == 0)
        return min(dpmin[l], dpmin[r - (1 << k) + 1]);
    else
        return max(dpmax[l], dpmax[r - (1 << k) + 1]);
}

int main(){

    while(~scanf("%d%d", &n, &m)){
        for(int i = 0; i < n; ++i)
            scanf("%d", a + i);
        k = log((double)m) / log((double)2.0);
        RMQ_init();
        for(int i = 0; (i + m - 1) < n - 1; ++i)
            printf("%d ", RMQ(i, i + m - 1, 0));
        printf("%d\n", RMQ(n - m, n - 1, 0));

        for(int i = 0; (i + m - 1) < n - 1; ++i)
            printf("%d ", RMQ(i, i + m - 1, 1));
        printf("%d\n", RMQ(n - m, n - 1, 1));
    }
    return 0;
}