AliceBuJu

单点修改，区间查询。#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#define lson num<<1,l,mid#define rson num<<1|1,mid+1,rusing namespace std;int n,m;int tree[400000+5],a[100000+5];

区间修改，区间查询。（把练习2的int改为long long即可）#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#define lson num<<1,l,mid#define rson num<<1|1,mid+1,r#define ll long longusing namespace s

区间修改，单点查询。#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#define lson num<<1,l,mid#define rson num<<1|1,mid+1,rusing namespace std;int n,m;const int maxn=200000+5;int tr

线段树。区间最值查询。#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#define lson num<<1,l,mid#define rson num<<1|1,mid+1,rusing namespace std;long long n,m;long long tree[810000+5]

洛谷95分 codevs AC的代码：#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#define lson num<<1,l,mid#define rson num<<1|1,mid+1,rusing namespace std;int n,m;int j;bool flag=1;co

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<cmath>#define ll long long#define lson num<<1,l,mid#define rson num<<1|1,mid+1,rusing namespace std;const ll maxn