题目连接
题意:
大小为N的数组 数组元素初始值为1,
Q次操作 每次操作
x,y,z表示从第x到第y所有的元素的值变为z,
最后问这串数字的和
数据范围:
1s
N 1e5
Q 1e5
思路:
线段树,成段替换, 区间求和
AC:
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdio.h>
#include<cstring>
using namespace std;
typedef long long ll;
const int MAX_LEN = 1e5 + 10;
int N, T, Q;
ll seg_tree[MAX_LEN << 2];
int lazy[MAX_LEN << 2];
void push_up(int root) {
seg_tree[root] = seg_tree[root << 1] + seg_tree[root << 1 | 1];
}
void push_down(int root, int L, int R) {
if(lazy[root]) {
int mid = (L + R) >> 1;
lazy[root << 1] = lazy[root];
lazy[root << 1 | 1] = lazy[root];
seg_tree[root << 1] = lazy[root] * (mid - L + 1); //左子树上的和加上lazy值
seg_tree[root << 1 | 1] = lazy[root] * (R - mid); //右子树上的和+上lazy值
lazy[root] = 0;
}
}
void build (int root, int L, int R) {
lazy[root] = 0;
if (L == R) {
seg_tree[root] = 1;
return ;
}
int mid = (L + R) / 2;
// [ L, mid] 左子树, [mid + 1, r]右子树
build(root << 1, L, mid);
build(root << 1 | 1, mid + 1, R);
push_up(root);
//对与当前的根节点,把当前的根节点的左右子树都算出来后,再更新它的值
// 沿路回溯, 回溯到点root 时, 都是被 [ L, R] 或者其子区间影响到的点,边回溯边更新
}
//点修改
//void update (int root, int L, int R,int pos, int val) {
// if(L == R) {
// seg_tree[root] += val;
// return ;
// }
// int mid = (L + R) / 2;
// // 左区间
// if (pos <= mid) update (root << 1, L, mid, pos, val);
// //右区间
// else update (root << 1 | 1, mid + 1, R, pos, val);
// push_up(root);
//}
//区间查旬
ll query (int root, int L, int R, int LL ,int RR) {
if( L >= LL && R <= RR) {
return seg_tree[root];
}
push_down(root, L, R); //每次访问都去检查Lazy标记
long long Ans = 0;
int mid = (L + R) >> 1;
if(LL <= mid) Ans += query(root << 1, L, mid, LL, RR);
if(RR > mid) Ans += query(root << 1 | 1, mid + 1, R, LL, RR);
return Ans;
}
//区间修改
void update (int root, int L, int R, int LL, int RR, int val) {
//[LL, RR] 为即将要更新的区间
if(LL <= L && R <= RR) {
//cout << L << " " << R << " " << val << endl;
lazy[root] = val;
seg_tree[root] = val * (R - L + 1);
return ;
}
//更新子树
push_down(root, L, R);
int mid = (L + R) >> 1;
if(LL <= mid) update(root << 1, L, mid, LL, RR, val);
if(RR > mid) update(root << 1 | 1, mid + 1, R, LL, RR, val);
//更新父节点
push_up(root);
}
int main(){
//freopen("in.txt", "r", stdin);
scanf("%d", &T);
int Cas = 0;
while(T--) {
//memset(lazy, 0, sizeof(lazy));
scanf("%d%d", &N, &Q);
build(1, 1, N);
int L, R, V;
for(int i = 1; i <= Q; ++i) {
scanf("%d%d%d", &L, &R, &V);
update(1, 1, N, L, R, V);
}
printf("Case %d: The total value of the hook is %I64d.\n",++Cas, seg_tree[1]);
}
return 0;
}