水题,造个线段树,把标记打线段树上,然后dfs一遍就行了
a可能等于b,判掉就好
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define MAXN 1010
#define MAXM 10000010
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
int v[MAXM],son[MAXM][2];
int tot;
int n;
ll ans;
int rt;
void change(int &x,int y,int z,int l,int r,int cv){
if(l>r){
return ;
}
if(!x){
x=++tot;
}
if(y==l&&z==r){
v[x]=max(v[x],cv);
return ;
}
int mid=y+z>>1;
if(r<=mid){
change(s