LightOJ 1082

线段树练习

#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<math.h>
#include<string.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rel(i,n) for(int (i)=1;(i)<=(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define delf int m=(l+r)>>1
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
const int MAXN=1e5;const int MOD=1e9+7;
const int MAXNODES=MAXN<<2;
int sum[MAXNODES];
int que[MAXNODES];
int min(int a,int b){return a<b?a:b;}
void pushup(int rt)
{
    sum[rt]=min(sum[rt<<1],sum[rt<<1|1]);
}
void build(int l,int r,int rt)
{
    if(l==r)
    {
        scanf("%d",&sum[rt]);
        return;
    }
    delf;
    build(lson);
    build(rson);
    pushup(rt);
}
void update(int p,int q,int l,int r,int rt)
{
    if(l==r)
    {
        sum[rt]=q;
        return;
    }
    delf;
    if(p<=m) update(p,q,lson);
    else update(p,q,rson);
    pushup(rt);
}
int query(int L,int R,int l,int r,int rt)
{
    if(L<=l&&R>=r) return sum[rt];
    delf;
    int ret=INF;
    if(L<=m) ret=min(ret,query(L,R,lson));
    if(R>m) ret=min(ret,query(L,R,rson));
    return ret;
}
int main()
{
    int t,n,q,a,b;
    scanf("%d",&t);
    rel(i,t)
    {
        int cnt=0;
        scanf("%d%d",&n,&q);
        build(1,n,1);
        rel(j,q)
        {
            scanf("%d%d",&a,&b);
            que[cnt++]=query(a,b,1,n,1);
        }
        printf("Case %d:\n",i);
        rep(i,cnt) printf("%d\n",que[i]);
    }
    return 0;
}