自写线段树,难点既每次节点的维护pushDOWN函数, add && set
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,(rt<<1|1)
#define INF 1000000100
const int maxn = 1000010;
int sum[21][maxn<<2],MAX[21][maxn<<2],MIN[21][maxn<<2],add[21][maxn<<2],val[21][maxn<<2];
void pushUP(int l,int r,int rt,int i){
sum[i][rt]=sum[i][rt<&l......
阅读全文