单点修改 区间修改 单点查询 区间查询
1.敌兵布阵
1.题意
2.思路
3.代码
2.I Hate It
1.题意
维护一段成绩,有改操作和查操作
2.思路
线段树的单点修改,区间查询,用到build、modify、pushup和query操作,具体看代码,线段树板子题
3.代码
#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
using namespace std;
const int N = 200010;
int n, m, w[N];
struct node{
int l, r;
int v;
}tr[N << 2];
void pushup(int u){
tr[u].v = max(tr[u << 1].v, tr[u << 1 | 1].v); //更新父节点的最大值
}
void build(int u, int l, int r){//建树
if(l == r) tr[u] = {l, r, w[r]};
else{
tr[u] = {l, r};
int mid = l + r >> 1;
build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
pushup(u);
}
}
void modify(int u, int x, int v){ //更新
if(tr[u].l == x && tr[u].r == x) tr[u].v = v;
else{
int mid = tr[u].l + tr[u].r >> 1;
if(x <= mid) modify(u << 1, x, v);
else modify(u << 1 | 1, x, v);
pushup(u);
}
}
int query(int u, int l, int r){ //查找
if(tr[u].l >= l && tr[u].r <= r) return tr[u].v;
int mid = tr[u].l + tr[u].r >> 1;
int v = 0;
if(l <= mid) v = query(u << 1, l, r);
if(r > mid) v = max(v, query(u << 1 | 1, l , r));
return v;
}
int main(){
while(~scanf("%d%d", &n, &m)){
for(int i = 1; i <= n; ++i) scanf("%d", &w[i]);
build(1, 1, n);
char op[2];
int l, r;
while(m --){
scanf("%s%d%d", op, &l, &r);
if(*op == 'U')
modify(1, l, r);
else
printf("%d\n", query(1, l ,r));
}
}
return 0;
}
3.A Simple Problem with Integers
1.题意
线段树区间修改和区间查询
2.思路
区间查询和修改板子题
注意
POJ不能用auto
结构体不能tr[u] = {a, ,b ,c, d}赋值,需要分开赋值。
节点值和懒标记值要开long long
3.代码
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
typedef long long LL;
using namespace std;
const int N = 100010;
int n, m;
int w[N];
struct node{
int l, r;
LL sum, add;
}tr[N << 2];
void pushup(int u){
tr[u].sum = tr[u <<1].sum + tr[u << 1 | 1].sum;
}
void pushdown(int u){
node &root = tr[u], &left = tr[u <<1], &right = tr[u << 1 | 1];
if(root.add){
left.add += root.add, left.sum += (LL)(left.r - left.l + 1) * root.add;
right.add += root.add, right.sum += (LL)(right.r - right.l + 1) * root.add;
root.add = 0;
}
}
void build(int u, int l, int r){
if(l == r){
tr[u].l = l;
tr[u].r = r;
tr[u].sum = w[r];
tr[u].add = 0;
}
else{
tr[u].l = l;
tr[u].r = r;
int mid = l + r >>1;
build(u <<1, l ,mid), build(u <<1 | 1, mid +1, r);
pushup(u);
}
}
void modify(int u, int l, int r, int d){
if(tr[u].l >= l &&tr[u].r <= r){
tr[u].sum += (LL)(tr[u].r - tr[u].l +1) * d;
tr[u].add += d;
}
else{ //分裂
pushdown(u);
int mid = tr[u].l + tr[u].r >>1;
if(l <= mid) modify(u <<1, l ,r ,d);
if(r > mid) modify(u <<1 | 1, l, r, d);
pushup(u);
}
}
LL query(int u, int l, int r){
if( tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
pushdown(u);
int mid = tr[u].l + tr[u].r >>1;
LL sum = 0;
if(l <= mid) sum = query(u << 1, l, r);
if(r > mid) sum += query(u << 1 | 1, l, r);
return sum;
}
int main(){
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; ++i) scanf("%d", &w[i]);
build(1, 1, n);
char op[2];
int l, r, d;
while(m --){
scanf("%s%d%d", op, &l, &r);
if(*op == 'C'){
scanf("%d", &d);
modify(1, l, r, d);
}
else printf("%lld\n", query(1, l, r));
}
return 0;
}
4.Mayor’s posters
1.题意
2.思路
3.代码
5.Just a Hook
1.题意
N个数, 初始全部为1, 进行Q次以下操作
把[l, r]的所有值改为V (1<=V<=3)
求N个数的和.
2.思路
线段树区间修改套板子
3.代码
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
typedef long long LL;
using namespace std;
const int N = 100010;
int n, m, cnt;
struct node{
int l, r;
LL sum, add;
}tr[N << 2];
void pushup(int u){
tr[u].sum = tr[u <<1].sum + tr[u << 1 | 1].sum;
}
void pushdown(int u){
auto &root = tr[u], &left = tr[u <<1], &right = tr[u << 1 | 1];
if(root.add){
left.add = root.add, left.sum = (LL)(left.r - left.l + 1) * root.add;
right.add = root.add, right.sum = (LL)(right.r - right.l + 1) * root.add;
root.add = 0;
}
}
void build(int u, int l, int r){
if(l == r) tr[u] = {l, r, 1, 0};
else{
tr[u] ={l, r};
int mid = l + r >>1;
build(u <<1, l ,mid), build(u <<1 | 1, mid +1, r);
pushup(u);
}
}
void modify(int u, int l, int r, int d){
if(tr[u].l >= l &&tr[u].r <= r){
tr[u].sum = (LL)(tr[u].r - tr[u].l +1) * d;
tr[u].add = d;
}
else{ //分裂
pushdown(u);
int mid = tr[u].l + tr[u].r >>1;
if(l <= mid) modify(u <<1, l ,r ,d);
if(r > mid) modify(u <<1 | 1, l, r, d);
pushup(u);
}
}
int main(){
int t;
scanf("%d", &t);
while(t--){
scanf("%d%d", &n, &m);
build(1, 1, n);
while(m--){
int l, r, d;
scanf("%d%d%d", &l, &r, &d);
modify(1, l, r, d);
}
printf("Case %d: The total value of the hook is %lld.\n",++cnt, tr[1].sum);
}
return 0;
}
6.Count the Colors
1.题意
2.思路
3.代码
7.Balanced Lineup
1.题意
求区间最大值与最小值的差
2.思路
线段树单点修改,区间查询
3.代码
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
typedef pair<int, int>PII;
const int N = 100010;
int n, m, cnt;
struct node{
int l, r;
int fmin, fmax;
}tr[N << 2];
void pushup(node &u, node &l, node &r){
u.fmin = min(l.fmin, r.fmin);
u.fmax = max(l.fmax, r.fmax);
}
void pushup(int u){
pushup(tr[u], tr[u << 1], tr[u << 1 | 1]);
}
void build(int u, int l, int r){
if(l == r) {
//tr[u] = {l, r, 0, 0};
tr[u].l = l;
tr[u].r = r;
tr[u].fmin = tr[u].fmax = 0;
}
else{
tr[u].l = l, tr[u].r = r;
//tr[u] ={l, r};
int mid = l + r >>1;
build(u <<1, l ,mid), build(u <<1 | 1, mid +1, r);
pushup(u);
}
}
void modify(int u, int x, int v){
if(tr[u].l ==x && tr[u].r == x) {
//tr[u] = {x, x, v, v};
tr[u].l = tr[u].r = x;
tr[u].fmin = tr[u].fmax = v;
}
else{
int mid = tr[u].l + tr[u].r >> 1;
if(x <= mid) modify(u << 1, x, v);
else modify(u << 1 | 1, x, v);
pushup(u);
}
}
node query(int u, int l, int r){
if(tr[u].l >= l &&tr[u].r <= r) return tr[u];
else{
int mid = tr[u].l + tr[u].r >> 1;
if(r <= mid) return query(u << 1, l, r);
else if( l >mid) return query(u << 1 |1, l, r);
else{
node left = query(u << 1, l, r);
node right = query(u << 1 |1, l, r);
node res;
pushup(res, left, right);
return res;
}
}
}
int main(){
int n, m, x, l, r;
scanf("%d%d", &n, &m);
build(1, 1, n);
for(int i = 0; i < n; ++i) {
scanf("%d", &x);
modify(1, i+1, x);
}
while (m--) {
scanf("%d%d", &l, &r);
node ans = query(1, l, r);
printf("%d\n", ans.fmax - ans.fmin);
}
return 0;
}