hdu1698 Just a Hook (线段树区间修改)
来源:互联网 发布:看门狗2低配置优化补丁 编辑:程序博客网 时间:2024/06/01 07:41
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.
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.
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.
11021 5 25 9 3
Case 1: The total value of the hook is 24.
题意:
举个栗子,1 5 2,代表把1 和 5之间的点全部都修改为2。
套用线段树区间修改模板即可。
#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int mx = 1e5 + 5;int sum[4 * mx],la[4 * mx];void pushdown(int rt, int l, int r){if(la[rt]){int m = (l + r) / 2;la[2 * rt] = la[2 * rt + 1] = la [rt];sum [2 * rt] = (m- l + 1) * la[rt];sum [2 * rt + 1] = (r - m) * la[rt];la [rt] = 0;}}void build(int l, int r, int rt){if(l == r) {sum[rt] = 1;return ; //忘了return }int m = (l + r) / 2;build(l, m, 2 * rt);build(m+1, r, 2 * rt + 1);sum[rt] = sum[2 * rt] + sum[2 * rt + 1]; }void update(int st, int en, int p, int l, int r, int rt){if(st <= l && r <= en){sum[rt] = (r - l + 1) * p;la[rt] = p;return ;}pushdown(rt, l, r);int m = (l + r) / 2;if(st <= m) update(st, en, p, l, m, 2 * rt);if(m < en) update(st, en, p, m+1, r, 2 * rt + 1);sum[rt] = sum[2 * rt] + sum[2 * rt + 1]; }int main(){int T,m, n;scanf("%d",&T);for(int i = 1; i <= T; i++){scanf("%d",&n);memset(la, 0, sizeof(la));build(1, n, 1);scanf("%d",&m);while(m--){int a, b, c;scanf("%d%d%d", &a, &b, &c);update(a, b, c, 1, n, 1);}printf("Case %d: The total value of the hook is %d.\n",i,sum[1]);}return 0;}
阅读全文
0 0
- hdu1698 Just a Hook(线段树区间修改)
- hdu1698 Just a Hook (线段树区间修改)
- hdu1698 Just a Hook(线段树区间修改)
- hdu1698--Just a Hook(线段树修改区间值,求区间和)
- HDU1698 - Just a Hook (线段树 区间更新)
- hdu1698 Just a Hook (线段树,区间更新)
- hdu1698 Just a Hook(线段树+区间染色)
- Just a Hook(hdu1698,线段树)
- hdu1698 Just a Hook(线段树)
- hdu1698 Just a Hook(线段树)
- HDU1698:Just a Hook(线段树)
- hdu1698 Just a Hook (线段树)
- HDU1698--Just a hook--线段树区间更新
- HDU1698:Just a Hook(线段树区间更新)
- hdu1698 Just a Hook(线段树区间更新)
- hdu1698 Just a Hook (线段树区间更新 懒惰标记)
- Just a Hook hdu1698 [线段树区间更新]
- hdu1698 Just a Hook 线段树区间更新,延时标记
- LeetCode-Maximum Subarray
- Android studio 混淆打包
- linux在退出当前用户的时候需要完成的命令
- AR/VR工作原理及目前存在的技术问题
- androidStudio快捷键概览
- hdu1698 Just a Hook (线段树区间修改)
- android定时广播 定时任务 问题
- 数据结构——顺序表和链表的比较
- WEB0914-0915
- 洛谷Oj-低价购买-最长下降子序列 +最佳方案数统计
- 三维绘图基础
- sublime 插件
- Ubuntu14.04安装caffe+cuda7.5+OpenCV2.4.9+Matlab2014A(显卡K80×2)
- 前缀式计算(栈和队列)