51Nod 1174 区间中最大的数<线段树>

题目链接

线段树基本操作（单点更新，区间极值，区间求和）

线段树 区间更新

#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
int a[10002*4];
int t[10002*4];
const int INF=1<<29;
int build(int node,int begin,int end){
	if(begin==end) t[node]=a[begin];
	else{
		int fz=(begin+end)/2;
		build(2*node,begin,fz);
		build(2*node+1,fz+1,end);
		t[node]=max(t[node*2],t[node*2+1]);
	}
}
int findmax(int node,int begin,int end,int z,int y){
	if(begin>=z&&end<=y){
		return t[node];
	}
	int ans=-INF,fz=(begin+end)/2;
	if(z<=fz) ans=max(ans,findmax(2*node,begin,fz,z,y));
	if(y>fz) ans=max(ans,findmax(2*node+1,fz+1,end,z,y));
	return ans;
}
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++) {
		scanf("%d",&a[i]);
	}
	build(1,1,n);
	int m;
	cin>>m;
	for(int i=0;i<m;i++){
		int a,b;
		scanf("%d%d",&a,&b);
		a++,b++;
		cout<<findmax(1,1,n,a,b)<<endl;
	}
	return 0;
}