线段树区间更新 lazy操作
#include <cstring>
#include <iostream>
#include <cstdio>
using namespace std;
#define Lson l,m,rt<<1
#define Rson m+1,r,rt<<1|1
int const MAXN = 100010;
struct TREE{
int l,r;
int v,add;
}tree[MAXN<<2];
inline int Max(int a,int b){
return a>b?a:b;
}
inline void PushUp(int rt){
tree[rt].v = tree[rt<<1].v + tree[rt<<1|1].v;
}
inline void PushDown(int rt,int m){
/*
m = R - L + 1
右子 区间为......
阅读全文