NOJ1042 线段树区间最值

中文题啊，由于一次比赛线段树查不出错误，外加自己博客没有留几篇，现在重新刷一遍线段树，无论简单难的都留下，以后偶尔看看，先由简单的开始回顾起来！

这题不难，很裸的寻找区间最值，连更新都没有，就是建树然后寻找最值

题目：http://acm.njupt.edu.cn/acmhome/problemdetail.do?&method=showdetail&id=1042

#include<iostream>
#include<cstdio>
#include<list>
#include<algorithm>
#include<cstring>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<cmath>
#include<memory.h>
#include<set>
#include<cctype>

#define ll long long

#define LL __int64

#define eps 1e-8

#define inf 0xfffffff

//const LL INF = 1LL<<61;

using namespace std;

//vector<pair<int,int> > G;
//typedef pair<int,int > P;
//vector<pair<int,int> > ::iterator iter;
//
//map<ll,int >mp;
//map<ll,int >::iterator p;


const int N = 10000 + 5;

int num[N];

int n;

typedef struct Node {
	int a;
};

Node tree[N * 4];

void init() {
	memset(tree,0,sizeof(tree));
	memset(num,0,sizeof(num));
}

void cal(int id) {
	tree[id].a = min(tree[id<<1].a,tree[id<<1|1].a);
}

void build(int l,int r,int id) {
	if(l == r) {
		tree[id].a = num[l];return;
	}
	int mid = (l + r)/2;
	build(l,mid,id<<1);
	build(mid+1,r,id<<1|1);
	cal(id);
}

int query(int L,int R,int l,int r,int id) {
	if(L <= l && R >= r)return tree[id].a;
	int mid = (l + r)/2;
	int ans = inf;
	if(L <= mid)ans = min(ans,query(L,R,l,mid,id<<1));
	if(R > mid) ans = min(ans,query(L,R,mid+1,r,id<<1|1));
	return ans;
}

int main() {
	while(scanf("%d",&n) == 1) {
		init();
		for(int i=1;i<=n;i++)
			scanf("%d",&num[i]);
		build(1,n,1);
		int q;
		scanf("%d",&q);
		while(q--) {
			int x,y;
			scanf("%d %d",&x,&y);
			int ans = query(x,y,1,n,1);
			printf("%d\n",ans);
		}
	}
	return 0;
}