成段更新,需要用到延迟标记(或者说懒惰标记),简单来说就是每次更新的时候不要更新到底,用延迟标记使得更新延迟到下次需要更新or询问到的时候.
此处建议在纸上模拟一遍。
Problem Description
In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.
Now Pudge wants to do some operations on the hook.
Let us number the consecutive metallic sticks of the hook from 1 to N. For each operation, Pudge can change the consecutive metallic sticks, numbered from X to Y, into cupreous sticks, silver sticks or golden sticks.
The total value of the hook is calculated as the sum of values of N metallic sticks. More precisely, the value for each kind of stick is calculated as follows:
For each cupreous stick, the value is 1.
For each silver stick, the value is 2.
For each golden stick, the value is 3.
Pudge wants to know the total value of the hook after performing the operations.
You may consider the original hook is made up of cupreous sticks.
Input
The input consists of several test cases. The first line of the input is the number of the cases. There are no more than 10 cases.
For each case, the first line contains an integer N, 1<=N<=100,000, which is the number of the sticks of Pudge’s meat hook and the second line contains an integer Q, 0<=Q<=100,000, which is the number of the operations.
Next Q lines, each line contains three integers X, Y, 1<=X<=Y<=N, Z, 1<=Z<=3, which defines an operation: change the sticks numbered from X to Y into the metal kind Z, where Z=1 represents the cupreous kind, Z=2 represents the silver kind and Z=3 represents
the golden kind.
Output
For each case, print a number in a line representing the total value of the hook after the operations. Use the format in the example.
Sample Input
Sample Output
Case 1: The total value of the hook is 24.
#include <stdio.h>
#include <iostream>
using namespace std;
const int N = 400000;
int tree[N], flag[N], x, y, value;
void build(int l, int r, int k) {
tree[k] = 1; //初始为1
flag[k] = 0;
if (l == r)
return;
int m = (l + r) / 2;
build(l, m, k * 2); //k*2 即为k的左子树
build(m + 1, r, k * 2 + 1); // k*2+1 即为k的右子树
tree[k] = tree[k * 2] + tree[k * 2 + 1]; //更新当前节点的指, 即左子树+右子树
}
//向下更新。 k为更新的节点的,m为更新区间的长度
//将k节点的信息更新到它的左右子树上
void down(int k, int m) {
if (flag[k]) {
flag[k * 2] = flag[k * 2 + 1] = flag[k];
tree[k * 2] = (m - (m / 2)) * flag[k];
tree[k * 2 + 1] = m / 2 * flag[k];
flag[k] = 0;
}
}
void update(int l, int r, int k) {
if (x <= l && y >= r) {
flag[k] = value; //存储当前的 value
tree[k] = (r - l + 1) * value;
return;
}
down(k, r - l + 1); //更新k节点
int m = (l + r) / 2;
if (x <= m)
update(l, m, k * 2);
if (y > m)
update(m + 1, r, k * 2 + 1);
tree[k] = tree[k * 2] + tree[k * 2 + 1];
}
int main() {
//freopen("in.txt", "r", stdin);
int T , n , m;
scanf("%d",&T);
for (int cas = 1; cas <= T; cas ++) {
scanf("%d%d",&n,&m);
build(1 , n , 1);
while(m--) {
scanf("%d %d %d", &x, &y, &value);
update( 1, n ,1);
}
printf("Case %d: The total value of the hook is %d.\n",cas , tree[1]);
}
return 0;
}
分享到:
相关推荐
hdu 1166线段树代码
hdu 1166线段树
从简单入门到偏中等的几个题,线段树很灵活,主要懂了lazy操作,其他的自己yy吧。
大量线段树题目 zoj 1610 线段覆盖 poj 2777 线段覆盖 ...hdu 1698 成段更新 poj 3468 成段更新 ural 1019 覆盖加统计最长同一个颜色 zoj 2301 和上一题差不多,但是这个染色染的是点,注意染色为空的状况
线段树入门资料,有利于初学者学习,让他们详细了解线段树。
NULL 博文链接:https://128kj.iteye.com/blog/1738772
【hdu5306】Gorgeous Sequence 线段树区间最值操作-附件资源
HDU的1250,主要是利用高精度加法,但是代码有点繁琐,效率不是很高
杭电ACMhdu1163
300+ AC 代码 。 大数 , 线段树 , 字符串 , dp.....
HDU1059的代码
hdu1001解题报告
hdu 1574 passed sorce
现在,给你两个正的小数A和B,你的任务是代表大明计算出A+B的值。 Input 本题目包含多组测试数据,请处理到文件结束。 每一组测试数据在一行里面包含两个长度不大于400的正小数A和B。 Output 请在一行里面...
HDU的一题........HDU DP动态规
NULL 博文链接:https://128kj.iteye.com/blog/1734821
hdu2101AC代码
hdu acm 教案 搜索入门 hdu acm 教案 搜索入门
搜索 dfs 解题代码 hdu1241