日常训练-线段树-1
最大数
题意
思路
线段树维护区间最大值,本题可以将每次的序列尾部加数转化成初始化的线段树的改值
代码
#include<iostream>
using namespace std;
const int N = 2e5 + 10;
struct Node {
int l, r;
int v;
}seg[N * 4];
int m, p;
int last;
void pushup(int u) {
seg[u].v = max(seg[u << 1].v, seg[u << 1 | 1].v);
}
void build(int u, int l, int r) {
seg[u] = {l, r};
if (l == r) return;
int mid = l + r >> 1;
build(u << 1, l, mid);
build(u << 1 | 1, mid + 1, r);
}
int query(int u, int l, int r) {
if (l <= seg[u].l && seg[u].r <= r) return seg[u].v;
int v = 0;
int mid = seg[u].l + seg[u].r >> 1;
if (l <= mid) v = query(u << 1, l, r);
if (r > mid) v = max(v, query(u << 1 | 1, l, r));
return v;
}
void modify(int u, int x, int v) {
if (seg[u].l == seg[u].r && seg[u].l == x) seg[u].v = v;
else {
int mid = seg[u].l + seg[u].r >> 1;
if (x <= mid) modify(u << 1, x, v);
else modify(u << 1 | 1, x, v);
pushup(u);
}
}
int main() {
cin >> m >> p;
build(1, 1, m);
char op;
int x, idx = 1;
while(m -- ) {
cin >> op >> x;
if (op == 'Q') {
last = query(1, idx - x + 1, idx);
cout << last << endl;
}else {
modify(1, idx + 1, (1ll * last + x) % p);
idx ++;
}
}
return 0;
}
线段树1
题意
思路
维护区间的最小值以及最小值的次数,使用第二种线段树写法
代码
#include<bits/stdc++.h>
using namespace std;
const int N =25e5 + 10;
int n, q;
int a[N];
struct info {
int minv, mincnt;
};
struct Node {
info val;
}tr[N * 4];
info operator + (const info &l, const info &r) {
info a;
a.minv = min(l.minv, r.minv);
if (l.minv == r.minv) a.mincnt = l.mincnt + r.mincnt;
else if (l.minv < r.minv) a.mincnt = l.mincnt;
else a.mincnt = r.mincnt;
return a;
}
void update(int id) {
tr[id].val = tr[id << 1].val + tr[id << 1 | 1].val;
}
void build(int id, int l, int r) {
if (l == r) {
tr[id].val = {a[r], 1};
}else {
int mid = l + r >> 1;
build(id << 1, l, mid);
build(id << 1 | 1, mid + 1, r);
update(id);
}
}
void change(int id, int l, int r, int pos, int val) {
if (l == r) {
tr[id].val = {val, 1};
}else {
int mid = l + r >> 1;
if (pos <= mid) change(id * 2, l, mid, pos, val);
else change(id * 2 + 1, mid + 1, r, pos, val);
update(id);
}
}
// [ql, qr] 表示查询的区间
info query(int id, int l, int r, int ql, int qr) {
if (l == ql && r == qr) return tr[id].val;
int mid = l + r >> 1;
if (qr <= mid) return query(id << 1, l, mid, ql, qr);
if (ql > mid) return query(id * 2 + 1, mid + 1, r, ql, qr);
else {
info left = query(id * 2, l, mid, ql, mid);
info right = query(id * 2 + 1, mid + 1, r, mid + 1, qr);
return left + right;
}
}
int main() {
scanf ("%d%d", &n, &q);
for (int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
build(1, 1, n);
while (q -- ) {
int op;
scanf ("%d", &op);
if (op == 1) {
int x, d;
scanf ("%d%d", &x, &d);
change(1, 1, n, x, d);
}else {
int l, r;
scanf ("%d%d", &l, &r);
auto res = query(1, 1, n, l, r);
printf("%d %d\n", res.minv, res.mincnt);
}
}
return 0;
}
Rorororobot
题意
思路
本题同样需要维护区间的最大值,同时我们需要特判一下起点和终点的距离在模 K K K意义上是否相等
代码
#include<iostream>
using namespace std;
const int N = 2e5 + 10;
int n, m, Q;
int h[N];
int a, b, c, d, k;
struct Node {
int l, r;
int ma;
}seg[4 * N];
void pushup(int u) {
seg[u].ma = max(seg[u << 1].ma, seg[u << 1 | 1].ma);
}
void build(int u, int l, int r) {
seg[u] = {l, r};
if (l == r) return;
int mid = l + r >> 1;
build(u << 1, l, mid);
build(u << 1 | 1, mid + 1, r);
}
int query(int u, int l, int r) {
if (l <= seg[u].l && seg[u].r <= r) return seg[u].ma;
int ma = 0;
int mid = seg[u].l + seg[u].r >> 1;
if (l <= mid) ma = query(u << 1, l, r);
if (r > mid) ma = max(ma, query(u << 1 | 1, l, r));
return ma;
}
void modify(int u, int x, int ma) {
if (seg[u].l == x && seg[u].r == x) seg[u].ma = ma;
else {
int mid = seg[u].l + seg[u].r >> 1;
if (x <= mid) modify(u << 1, x, ma);
else modify(u << 1 | 1, x, ma);
pushup(u);
}
}
bool chk() {
// 横纵坐标是否模k相等
if (abs(a - c) % k != 0 || abs(b - d) % k != 0)
return 0;
return 1;
}
signed main() {
scanf ("%d %d", &n, &m);
build(1, 1, m);
for (int i = 1; i <= m; i ++ ) scanf ("%d", &h[i]);
for (int i = 1; i <= m; i ++ ) modify(1, i, h[i]);
scanf("%d", &Q);
while (Q -- ) {
scanf ("%d %d %d %d %d", &a, &b, &c, &d, &k);
if (b > d) swap(a, c), swap(b, d);
int ma = (n - a) / k * k + a;
query(1, b, d) >= ma || !chk() ? printf("NO\n") : printf("YES\n");
}
return 0;
}
你能回答这些问题吗
题意
思路
本题需要构造线段树来维护区间最大连续字段和
线段树需要维护每个区间的和
s
u
m
sum
sum、最大前缀连续字段和
L
L
L、最大后缀连续字段和
R
R
R,以及最大连续字段和
M
M
M
各属性的关系:
u.sum = l.sum + r.sum;
u.lmax = max(l.lmax, l.sum + r.lmax);
u.rmax = max(r.rmax, r.sum + l.rmax);
u.tmax = max(max(l.tmax, r.tmax), l.rmax + r.lmax);
代码
#include<iostream>
using namespace std;
const int N = 5e5 + 10;
int n, m;
int w[N];
struct Node {
int l, r;
int sum, lmax, rmax, tmax;
}tr[N * 4];
void pushup(Node &u, Node &l, Node &r) {
u.sum = l.sum + r.sum;
u.lmax = max(l.lmax, l.sum + r.lmax);
u.rmax = max(r.rmax, r.sum + l.rmax);
u.tmax = max(max(l.tmax, r.tmax), l.rmax + r.lmax);
}
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, w[r], w[r], w[r], w[r]};
else {
int mid = l + r >> 1;
tr[u] = {l, r};
build(u << 1, l, mid);
build(u << 1 | 1, mid + 1, r);
pushup(u);
}
}
Node query(int u, int l, int r) {
if (l <= tr[u].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 {
auto left = query(u << 1, l, r);
auto right = query(u << 1 | 1, l, r);
Node res;
pushup(res, left, right);
return res;
}
}
}
void modify(int u, int x, int v) {
if(tr[u].l == x && tr[u].r == x) tr[u] = {x, x, v, v, 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 main() {
cin >> n >> m;
for (int i = 1; i <= n; i ++ ) cin >> w[i];
build(1, 1, n);
int k, x, y;
while (m -- ) {
cin >> k >> x >> y;
if (k == 1) {
if (x > y) swap(x, y);
cout << query(1, x, y).tmax << endl;
}else modify(1, x, y);
}
return 0;
}
线段树2
题意
思路
同样是维护区间的最大字段和,这里使用封装的写法
代码
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2e5 + 10;
int n, q;
int a[N];
struct info {
LL M, L, R, sum;
info () {}
info (int a):M(a), L(a), R(a), sum(a){}
};
struct Node {
info val;
}tr[N * 4];
info operator + (const info &l, const info &r) {
info a;
a.M = max({l.M, r.M, l.R + r.L});
a.L = max(l.L, l.sum + r.L);
a.R = max(r.R, r.sum + l.R);
a.sum = l.sum + r.sum;
return a;
}
void update(int id) {
tr[id].val = tr[id << 1].val + tr[id << 1 | 1].val;
}
void build(int id, int l, int r) {
if (l == r) {
tr[id].val = info(a[r]);
}else {
int mid = l + r >> 1;
build(id << 1, l, mid);
build(id << 1 | 1, mid + 1, r);
update(id);
}
}
void change(int id, int l, int r, int pos, int val) {
if (l == r) {
tr[id].val = info(val);
}else {
int mid = l + r >> 1;
if (pos <= mid) change(id * 2, l, mid, pos, val);
else change(id * 2 + 1, mid + 1, r, pos, val);
update(id);
}
}
info query(int id, int l, int r, int ql, int qr) {
if (l == ql && r == qr) return tr[id].val;
int mid = l + r >> 1;
if (qr <= mid) return query(id << 1, l, mid, ql, qr);
if (ql > mid) return query(id * 2 + 1, mid + 1, r, ql, qr);
else {
info left = query(id * 2, l, mid, ql, mid);
info right = query(id * 2 + 1, mid + 1, r, mid + 1, qr);
return left + right;
}
}
int main() {
scanf ("%d%d", &n, &q);
for (int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
build(1, 1, n);
while (q -- ) {
int op;
scanf ("%d", &op);
if (op == 1) {
int x, d;
scanf ("%d%d", &x, &d);
change(1, 1, n, x, d);
}else {
int l, r;
scanf ("%d%d", &l, &r);
auto res = query(1, 1, n, l, r);
printf("%lld\n", res.M);
}
}
return 0;
}
区间最大公约数
题意
思路
本题的突破口是使用差分数组将 区间修改和区间查询转化成单点修改和区间查询,所以无需使用懒标记
同时可以使用差分的一个前提是区间的最大公约数等于它的差分区间的最大公约数
代码
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 5e5 + 10;
struct Node {
int l, r;
int sum, d;
}tr[N * 4];
int n, m;
int w[N];
void pushup(Node &u, Node &l, Node &r) {
u.sum = l.sum + r.sum;
u.d = __gcd(l.d, r.d);
}
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) {
int tmp = w[r] - w[r - 1];
tr[u] = {l, r, tmp, tmp};
}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) {
int tmp = tr[u].sum + v;
tr[u] = {x, x, tmp, tmp};
}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 (l > r) return {0};
if (l <= tr[u].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;
}
}
}
signed main() {
cin >> n >> m;
for (int i = 1; i <= n; i ++ ) cin >> w[i];
build(1, 1, n);
while (m -- ) {
char op;
cin >> op;
if (op == 'C') {
int l, r, d;
cin >> l >> r >> d;
modify(1, l, d);
if (r + 1 <= n) modify(1, r + 1, -d);
}else {
int l, r;
cin >> l >> r;
cout << abs(__gcd(query(1, 1, l).sum, query(1, l + 1, r).d)) << endl;
}
}
return 0;
}