hdu-------(1698)Just a Hook(线段树区间更新)
Just a Hook
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 17124 Accepted Submission(s): 8547
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.
10
2
1 5 2
5 9 3
成段更新(通常这对初学者来说是一道坎),需要用到延迟标记(或者说懒惰标记),简单来说就是每次更新的时候不要更新到底,用延迟标记使得更新延迟到下次需要更新or询问到的时候
代码:
#include<cstring>
#include<cstdio>
const int maxn=;
struct node
{
int lef,rig,sum;
int cnt;
int mid(){
return lef+(rig-lef>>);
}
}; node sac[maxn*]; void Build(int left,int right,int pos)
{
sac[pos]=(node){left,right,};
if(left==right)return ;
int mid=sac[pos].mid();
Build(left,mid,pos<<);
Build(mid+,right,pos<<|);
sac[pos].sum=sac[pos<<].sum+sac[pos<<|].sum;
}
void Update(int left,int right,int pos,int val)
{
if(left<=sac[pos].lef&&sac[pos].rig<=right){
sac[pos].sum=val*(sac[pos].rig-sac[pos].lef+);
sac[pos].cnt=val;
return ;
}
if(sac[pos].cnt!=){ //向下更新一次
sac[pos<<].sum=sac[pos].cnt*(sac[pos<<].rig-sac[pos<<].lef+);
sac[pos<<|].sum=sac[pos].cnt*(sac[pos<<|].rig-sac[pos<<|].lef+);
sac[pos<<|].cnt=sac[pos<<].cnt=sac[pos].cnt;
sac[pos].cnt=;
}
int mid=sac[pos].mid();
if(mid>=left)
Update(left,right,pos<<,val);
if(mid<right)
Update(left,right,pos<<|,val);
sac[pos].sum=sac[pos<<].sum+sac[pos<<|].sum;
}
int main()
{
int test,n,Q;
int a,b,c;
scanf("%d",&test);
for(int i=;i<=test;i++){
scanf("%d%d",&n,&Q);
Build(,n,);
while(Q--)
{
scanf("%d%d%d",&a,&b,&c);
Update(a,b,,c);
}
printf("Case %d: The total value of the hook is %d.\n",i,sac[].sum);
}
}
最新文章
- 【Java EE 学习 54】【OA项目第一天】【SSH事务管理不能回滚问题解决】【struts2流程回顾】
- 如何用UE(UltraEdit)删除重复行?--转
- 【GoLang】与或非 异或操作
- Linux:Ubuntu 14.04 Server 离线安装Jjava8(及在线安装)
- Jquery源码中的Javascript基础知识(三)
- c可变参数函数
- IntervalZero RTX 2014
- PowerDesigner 模型文档 说明
- AndroidStudio文件夹结构视图讲解
- ashx实现文件下载以及文件MD5码测试
- select刷新后,保持选定状态,Cookies存储select选定状态信息
- css3模拟jq点击事件
- sqlserver 导入excel
- innodb 关键特性(insert buffer)
- Codeforces Beta Round #55 (Div. 2)
- vue 开发系列(八) 动态表单开发
- Redis-audit工具使用(转)
- c++ 判断两个容器是否相等(equal)
- 20155301 滕树晨linux基础——linux进程间通信(IPC)机制总结
- [实战]MVC5+EF6+MySql企业网盘实战(21)——网盘操作日志