poj3264
题意:给定一个长度为n的数组,m次访问,每次访问一段数组区间的最大值和最小值之差。
这道题可以运用线段树解决,也可以用RMQ解决:
1.线段树
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#define ml root<<1
#define mr root<<1|1
using namespace std;
const int N=5e4+44;
const int inf=0x3f3f3f3f;
int a[N];
int maxn,minn;
struct node{
int maxn,minn;
}mp[N<<2];
inline void up_date(int root) //将每一个点代表的区间计算出最小和最大值;
{
mp[root].maxn=max(mp[ml].maxn,mp[mr].maxn);
mp[root].minn=min(mp[ml].minn,mp[mr].minn);
}
void build_tree(int root, int l, int r)// 建树;
{
if(l==r){
mp[root].maxn=mp[root].minn=a[l];
return ;
}
int mid=l+(r-l)/2;
build_tree(ml,l,mid);
build_tree(mr,mid+1,r);
up_date(root);
}
void search_(int root, int l, int r, int x, int y) //查找;
{
if(l==x&&r==y){
minn=min(minn,mp[root].minn);
maxn=max(maxn,mp[root].maxn);
return ;
}
int mid=l+(r-l)/2;
if(y<=mid){
search_(ml,l,mid,x,y);
}else if(x>mid){
search_(mr,mid+1,r,x,y);
}else{
search_(ml,l,mid,x,mid);
search_(mr,mid+1,r,mid+1,y);
}
}
int main()
{
int n,q,x,y;
scanf("%d%d",&n,&q);
for(int i=1;i<=n;++i)
scanf("%d",&a[i]);
build_tree(1,1,n);
for(int i=0;i<q;++i){
scanf("%d%d",&x,&y);
minn=inf,maxn=-1;
search_(1,1,n,x,y);
printf("%d\n",maxn-minn);
}
return 0;
}
2.RMQ
主要有两个步骤:
1、初始化建立dp[i][j] 数组,表示在(i到
2
j
2^j
2j)区间的最值。可以推出状态方程(自己怎么可能想到?)dp[i][j]=min(dp[i][j-1],dp[i+2^(j-1)])
2、查询:令k=(int )(
log
2
(
r
−
l
+
1
)
\log_2(r-l+1)
log2(r−l+1)),则ans=min(dp[l][k],dp[r-
2
k
+
1
2^k+1
2k+1][k]);
具体推导推荐博客:RMQ原理推荐
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
using namespace std;
const int N=1e5;
int dp0[N][20],dp1[N][20];
int n;
void build_()
{
for(int j=1;(1<<j)<=n;++j){
for(int i=1;i<=n;++i){
int s=i+(1<<(j-1));
if(s>n) break;
dp0[i][j]=min(dp0[i][j-1],dp0[s][j-1]);
dp1[i][j]=max(dp1[i][j-1],dp1[s][j-1]);
}
}
}
int search_(int l, int r)
{
int k=int(log2(r-l+1));
int s=r-(1<<k)+1;
int minn=min(dp0[l][k],dp0[s][k]);
int maxn=max(dp1[l][k],dp1[s][k]);
return maxn-minn;
}
int main(){
int m,x,l,r;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i){
scanf("%d",&x);
dp0[i][0]=dp1[i][0]=x;
}
build_();
for(int i=0;i<m;++i){
scanf("%d%d",&l,&r);
printf("%d\n",search_(l,r));
}
return 0;
}