摘要:
类型:单点更新,线段树 / 树状数组代码:#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
inline int Rint() {int x; scanf("%d", &x); return x;} #define MAXN 200002
//#define MAX(x, y) (x)>(y)? (x):(y) 用这个算MAX(ret, query(L, R, a[e].mid+1, r, e<<1|1)),会超
阅读全文