poj--3264 Balanced Lineup(RMQ)

poj 3264

题解

RMQ练手。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;

const int maxn = 50000 + 10;
int   ax[maxn][20], in[maxn][20];
int   n, q;

void RMQ()
{
    int a;
    for(int i = 1; i <= n; ++i){
        scanf("%d", &a);
        ax[i][0] = in[i][0] = a;
    }
    int k = (int)(log(n) / log(2));
    for(int j = 1; j <= k; ++j)
    {
        for(int i = 1; i <= n; ++i){
            if(i + (1 << j) - 1 <= n){
                ax[i][j] = max(ax[i][j - 1], ax[i + (1 << (j - 1))][j - 1]);
                in[i][j] = min(in[i][j - 1], in[i + (1 << (j - 1))][j - 1]);
            }
        }
    }
}

int query(int flag, int a, int b)
{
    int k = (int)(log(b - a + 1) / log(2));
    return flag ? max(ax[a][k], ax[b - (1 << k) + 1][k]) : min(in[a][k], in[b - (1 << k) + 1][k]);
}

int main()
{
    while(cin >> n >> q)
    {
        RMQ();
        int a, b;
        while(q--)
        {
            scanf("%d %d", &a, &b);
            printf("%d\n", query(1, a, b) - query(0, a, b));
        }
    }
    return 0;
}