hihoCoder#1068 RMQ-ST算法

原题地址

Spare Table练习

记得用scanf和printf输入输出，否则会TLE

代码：

#include <iostream>
#include <cstring>
#include <cmath>

using namespace std;

#define MAX_SIZE 1000010

int N, Q;
int w[MAX_SIZE];
int q[MAX_SIZE][32];

void build() {
  for (int i = 1; (1 << i) <= N; i++) {
    for (int j = 0; j + (1 << i) <= N; j++) {
      q[j][i] = min(q[j][i - 1], q[j + (1 << (i - 1))][i - 1]);
    }
  }
}

int query(int l, int r) {
  int len = r - l + 1;
  int i = 0;

  while ((1 << (i + 1)) <= len)
    i++;
  return min(q[l][i], q[r - (1 << i) + 1][i]);
}

int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    scanf("%d", &(w[i]));
    q[i][0] = w[i];
  }

  build();

  scanf("%d", &Q);
  while (Q--) {
    int l, r;
    scanf("%d%d", &l, &r);
    printf("%d
", query(l - 1, r - 1));
  }

  return 0;