花点时间写了线段树小模板,区间合并、覆盖、异或种类比较多,重在变换,模板就不写了。
一、单点更新,查询区间最大值、区间最小值、区间和。
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (3000+10)
#define MAXM (50000000)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
using namespace std;
struct Tree
{
int l, r;
int sum, Max, Min;
};
Tree tree[MAXN<<2];
void PushUp(int o)
{
tree[o].sum = tree[ll].sum + tree[rr].sum;
tree[o].Max = max(tree[ll].Max, tree[rr].Max);
tree[o].Min = min(tree[ll].Min, tree[rr].Min);
}
void build(int o, int l, int r)
{
tree[o].l = l, tree[o].r = r;
if(l == r)
{
int a; scanf("%d", &a);
tree[o].sum = tree[o].Max = tree[o].Min = a;
return ;
}
int mid = (l + r) >> 1;
build(lson);
build(rson);
PushUp(o);
}
void update(int o, int pos, int val)
{
if(tree[o].l == tree[o].r)
{
tree[o].sum = tree[o].Max = tree[o].Min = val;
return ;
}
int mid = (tree[o].l + tree[o].r) >> 1;
if(pos <= mid)
update(ll, pos, val);
else
update(rr, pos, val);
PushUp(o);
}
int Query(int o, int L, int R, char *op)
{
if(L <= tree[o].l && R >= tree[o].r)
{
if(strcmp(op, "Max") == 0)
return tree[o].Max;
else if(strcmp(op, "Min") == 0)
return tree[o].Min;
else
return tree[o].sum;
}
int mid = (tree[o].l + tree[o].r) >> 1;
if(R <= mid)
return Query(ll, L, R, op);
else if(L > mid)
return Query(rr, L, R, op);
else
{
if(strcmp(op, "Max") == 0)
return max(Query(ll, L, mid, op), Query(rr, mid+1, R, op));
else if(strcmp(op, "Min") == 0)
return min(Query(ll, L, mid, op), Query(rr, mid+1, R, op));
else
return Query(ll, L, mid, op) + Query(rr, mid+1, R, op);
}
}
int main()
{
int N, Q;
while(scanf("%d%d", &N, &Q) != EOF)
{
build(1, 1, N);
while(Q--)
{
char op[5]; int x, y;
scanf("%s%d%d", op, &x, &y);
//U x y —— 更新x位置元素为y
//Max x y—— 查询区间[x, y]最大值
//Min x y—— 查询区间[x, y]最小值
//sum x y—— 查询区间[x, y]之和
if(op[0] == 'U')
update(1, x, y);
else
printf("%d\n", Query(1, x, y, op));
}
}
return 0;
}
二、区间加、减更新 + 查询区间最大值、区间最小值、区间和。
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (3000+10)
#define MAXM (50000000)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
using namespace std;
struct Tree
{
int l, r, len;//区间左右端点 区间长度
int sum, Max, Min;
int lazy;//延迟标记
};
Tree tree[MAXN<<2];
void PushUp(int o)
{
tree[o].sum = tree[ll].sum + tree[rr].sum;
tree[o].Max = max(tree[ll].Max, tree[rr].Max);
tree[o].Min = min(tree[ll].Min, tree[rr].Min);
}
void PushDown(int o)
{
if(tree[o].lazy)
{
tree[ll].lazy += tree[o].lazy;
tree[rr].lazy += tree[o].lazy;
tree[ll].Max += tree[o].lazy;
tree[rr].Max += tree[o].lazy;
tree[ll].Min += tree[o].lazy;
tree[rr].Min += tree[o].lazy;
tree[ll].sum += tree[o].lazy * tree[ll].len;
tree[rr].sum += tree[o].lazy * tree[rr].len;
tree[o].lazy = 0;
}
}
void build(int o, int l, int r)
{
tree[o].l = l, tree[o].r = r;
tree[o].len = r-l+1;
tree[o].lazy = 0;
if(l == r)
{
int a; scanf("%d", &a);
tree[o].sum = tree[o].Max = tree[o].Min = a;
return ;
}
int mid = (l + r) >> 1;
build(lson);
build(rson);
PushUp(o);
}
void update(int o, int L, int R, int v)
{
if(L <= tree[o].l && R >= tree[o].r)
{
tree[o].lazy += v;
tree[o].Max += v; tree[o].Min += v;
tree[o].sum += v * tree[o].len;
return ;
}
PushDown(o);
int mid = (tree[o].l + tree[o].r) >> 1;
if(R <= mid)
update(ll, L, R, v);
else if(L > mid)
update(rr, L, R, v);
else
{
update(ll, L, mid, v);
update(rr, mid+1, R, v);
}
PushUp(o);
}
int Query(int o, int L, int R, char *op)
{
if(L <= tree[o].l && R >= tree[o].r)
{
if(strcmp(op, "Max") == 0)
return tree[o].Max;
else if(strcmp(op, "Min") == 0)
return tree[o].Min;
else
return tree[o].sum;
}
PushDown(o);
int mid = (tree[o].l + tree[o].r) >> 1;
if(R <= mid)
return Query(ll, L, R, op);
else if(L > mid)
return Query(rr, L, R, op);
else
{
if(strcmp(op, "Max") == 0)
return max(Query(ll, L, mid, op), Query(rr, mid+1, R, op));
else if(strcmp(op, "Min") == 0)
return min(Query(ll, L, mid, op), Query(rr, mid+1, R, op));
else
return Query(ll, L, mid, op) + Query(rr, mid+1, R, op);
}
}
int main()
{
int N, Q;
while(scanf("%d%d", &N, &Q) != EOF)
{
build(1, 1, N);
while(Q--)
{
char op[5]; int x, y, v;
scanf("%s", op);
//U x y v —— [x, y]元素全加v
//Max x y—— 查询区间[x, y]最大值
//Min x y—— 查询区间[x, y]最小值
//sum x y—— 查询区间[x, y]之和
if(op[0] == 'U')
{
scanf("%d%d%d", &x, &y, &v);
update(1, x, y, v);
}
else
{
scanf("%d%d", &x, &y);
printf("%d\n", Query(1, x, y, op));
}
}
}
return 0;
}
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (3000+10)
#define MAXM (50000000)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
using namespace std;
struct Tree
{
int l, r, len;//区间左右端点 区间长度
int sum, Max, Min;
int lazy;//延迟标记
};
Tree tree[MAXN<<2];
void PushUp(int o)
{
tree[o].sum = tree[ll].sum + tree[rr].sum;
tree[o].Max = max(tree[ll].Max, tree[rr].Max);
tree[o].Min = min(tree[ll].Min, tree[rr].Min);
}
void PushDown(int o)
{
if(tree[o].lazy != -1)
{
tree[ll].lazy = tree[o].lazy;
tree[rr].lazy = tree[o].lazy;
tree[ll].Max = tree[o].lazy;
tree[rr].Max = tree[o].lazy;
tree[ll].Min = tree[o].lazy;
tree[rr].Min = tree[o].lazy;
tree[ll].sum = tree[o].lazy * tree[ll].len;
tree[rr].sum = tree[o].lazy * tree[rr].len;
tree[o].lazy = -1;
}
}
void build(int o, int l, int r)
{
tree[o].l = l, tree[o].r = r;
tree[o].len = r-l+1;
tree[o].lazy = -1;
if(l == r)
{
int a; scanf("%d", &a);
tree[o].sum = tree[o].Max = tree[o].Min = a;
return ;
}
int mid = (l + r) >> 1;
build(lson);
build(rson);
PushUp(o);
}
void update(int o, int L, int R, int v)
{
if(L <= tree[o].l && R >= tree[o].r)
{
tree[o].lazy = v;
tree[o].Max = v; tree[o].Min = v;
tree[o].sum = v * tree[o].len;
return ;
}
PushDown(o);
int mid = (tree[o].l + tree[o].r) >> 1;
if(R <= mid)
update(ll, L, R, v);
else if(L > mid)
update(rr, L, R, v);
else
{
update(ll, L, mid, v);
update(rr, mid+1, R, v);
}
PushUp(o);
}
int Query(int o, int L, int R, char *op)
{
if(L <= tree[o].l && R >= tree[o].r)
{
if(strcmp(op, "Max") == 0)
return tree[o].Max;
else if(strcmp(op, "Min") == 0)
return tree[o].Min;
else
return tree[o].sum;
}
PushDown(o);
int mid = (tree[o].l + tree[o].r) >> 1;
if(R <= mid)
return Query(ll, L, R, op);
else if(L > mid)
return Query(rr, L, R, op);
else
{
if(strcmp(op, "Max") == 0)
return max(Query(ll, L, mid, op), Query(rr, mid+1, R, op));
else if(strcmp(op, "Min") == 0)
return min(Query(ll, L, mid, op), Query(rr, mid+1, R, op));
else
return Query(ll, L, mid, op) + Query(rr, mid+1, R, op);
}
}
int main()
{
int N, Q;
while(scanf("%d%d", &N, &Q) != EOF)
{
build(1, 1, N);
while(Q--)
{
char op[5]; int x, y, v;
scanf("%s", op);
//U x y v —— [x, y]元素变为v 注意v>=0
//Max x y—— 查询区间[x, y]最大值
//Min x y—— 查询区间[x, y]最小值
//sum x y—— 查询区间[x, y]之和
if(op[0] == 'U')
{
scanf("%d%d%d", &x, &y, &v);
update(1, x, y, v);
}
else
{
scanf("%d%d", &x, &y);
printf("%d\n", Query(1, x, y, op));
}
}
}
return 0;
}
随手写的,有bug的地方还请指出。