POJ - 3264 Balanced Lineup（RMQ倍增，线段树）

POJ - 3264 Balanced Lineup（RMQ倍增，线段树）

RMQ倍增

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
const int M = 16, N = 1 << M;
int n, m;
int w[N], f[N][M], g[N][M];
void init()
{
	for (int i = 1; i <= n; i ++) f[i][0] = w[i];
	for (int j = 1; (1 << j) <= n; j ++ )
		for (int i = 1; i + (1 << j) - 1 <= n; i ++ )
			f[i][j] = max(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);

	for (int i = 1; i <= n; i ++) g[i][0] = w[i];
	for (int j = 1; (1 << j) <= n; j ++ )
		for (int i = 1; i + (1 << j) - 1 <= n; i ++ )
			g[i][j] = min(g[i][j - 1], g[i + (1 << (j - 1))][j - 1]);
}
int query_max(int l, int r)
{
	int len = r - l + 1;
	int k = log(len) / log(2);
	return max(f[l][k], f[r - (1 << k) + 1][k]);
}
int query_min(int l, int r)
{
	int len = r - l + 1;
	int k = log(len) / log(2);
	return min(g[l][k], g[r - (1 << k) + 1][k]);
}
int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
	init();
	while (m--)
	{
		int l, r;scanf("%d%d", &l, &r);
		printf("%d\n", query_max(l, r) - query_min(l, r));
	}
	return 0;
}

线段树

#include<iostream>
#include<cstdio>
using namespace std;
const int N=1000010;
struct Node
{
    int l,r;
	int maxx,minn;
}tr[N*4];
void bulid(int u,int l,int r)
{
    if(l==r) tr[u]=(Node){l,r,0,0};
    else
    {
    	tr[u]=(Node){l,r,0,0};
	    int mid=(tr[u].l+tr[u].r)>>1;
	    bulid(u<<1,l,mid);
		bulid(u<<1|1,mid+1,r);
	}
}
void pushup(int u)
{
    tr[u].maxx=max(tr[u<<1].maxx,tr[u<<1|1].maxx);
    tr[u].minn=min(tr[u<<1].minn,tr[u<<1|1].minn);
}
void modify(int u,int x,int w)
{
    if(tr[u].l==x&&tr[u].r==x) tr[u].maxx=tr[u].minn=w;
    else 
    {
        int mid=(tr[u].l+tr[u].r)>>1;
        if(x<=mid) modify(u<<1,x,w);
        if(x>mid) modify(u<<1|1,x,w);
        pushup(u);
    }
}
int query_max(int u,int l,int r)
{
    if(tr[u].l>=l&&tr[u].r<=r) return tr[u].maxx;
    else
    {
	    int mid=(tr[u].l+tr[u].r)>>1;
		int res=0;
	    if(l<=mid) res=max(res,query_max(u<<1,l,r));
	    if(r>mid) res=max(res,query_max(u<<1|1,l,r));
	    return res;	
	}
}
int query_min(int u,int l,int r)
{
    if(tr[u].l>=l&&tr[u].r<=r) return tr[u].minn;
    else
    {
	    int mid=(tr[u].l+tr[u].r)>>1;
		int res=1e9;
	    if(l<=mid) res=query_min(u<<1,l,r);
	    if(r>mid) res=min(res,query_min(u<<1|1,l,r));
	    return res;
	}
}
int main()
{
    int n,m;scanf("%d%d",&n,&m);
    bulid(1,1,n);
    for(int i=1;i<=n;i++)
    {
        int x;scanf("%d",&x);
        modify(1,i,x);
    }
    while(m--)
    {
        int x,y;scanf("%d %d",&x,&y);
        printf("%d\n",query_max(1,x,y)-query_min(1,x,y));
    }
    return 0;
}