hiho一下 第十八周 RMQ问题再临

相比于之前的RMQ问题，这道题增加了修改功能，鉴于数据规模比较小，可以增加一个Adjust()，用于调整min[][]的值

代码如下：

#include <stdio.h>
#include <math.h>
#define MAX_N 10000 

int weight[MAX_N], N;
int min[MAX_N][14]; //min[i][j]存储从i开始，长度为2^j序列中的最小值 

int Min(int a, int b){
	return a < b ? a : b;
}

void RMQ_ST(){
	int m = (int)(log((double)N)/log(2.0));
	int i, j, n;
	
	for(i = 0; i < N; i++){
		min[i][0] = weight[i];
	}
	for(j = 1; j <= m; j++){
		n = N+1-(1 << j);
		for(i = 0; i < n; i++){
			min[i][j] = Min(min[i][j-1], min[i+(1 << (j-1))][j-1]);
		}
	}
}

void Adjust(int p, int w){
	int i, j, m, n;
	
	weight[p] = w;
	min[p][0] = w;
	m = (int)(log((double)N)/log(2.0));
	for(j = 1; j <= m; j++){
		n = N+1-(1 << j);
		i = p+1-(1 << j);
		if(i < 0){
			i = 0;
		}
		for(; i <= p && i < n; i++){
			min[i][j] = Min(min[i][j-1], min[i+(1 << (j-1))][j-1]);
		}
	}
} 

int Querry(int L, int R){
	int m = (int)(log((double)(R-L+1))/log(2.0));
	return Min(min[L][m], min[R+1-(1 << m)][m]);
}

int main(){
	int i, Q, L, R, q;
	scanf("%d", &N);
	for(i = 0; i < N; i++){
		scanf("%d", &weight[i]);
	}
	
	RMQ_ST();
	
	scanf("%d", &Q);
	while(Q--){
		scanf("%d%d%d", &q, &L, &R);
		if(!q){
			printf("%d\n", Querry(L-1, R-1));
		}else{
			Adjust(L-1, R);
		}
	}
	
	return 0;
}