HDU 1698(Just a Hook )
来源:互联网 发布:c语言graphics图库 编辑:程序博客网 时间:2024/05/20 19:15
#include<stdio.h>
#include<string.h>
struct node
{
int a,b,value;
}tree[300005];
int ans;
void maketree(int i,int a,int b)
{
tree[i].a=a;
tree[i].b=b;
tree[i].value =1;
if(a==b)
return;
int mid=(a+b)/2;
maketree(i*2,a,mid);
maketree(i*2+1,mid+1,b);
}
void update(int i,int a,int b,int value)
{
if(tree[i].value ==value)
return;
if(tree[i].a ==a && tree[i].b==b)
{
tree[i].value =value;
return;
}
if(tree[i].value !=-1)
{
tree[i*2+1].value =tree[i*2].value =tree[i].value ;
tree[i].value =-1;
}
int mid=(tree[i].a+tree[i].b)/2;
if(a>mid)
update(i*2+1,a,b,value);
else if(b<=mid)
update(i*2,a,b,value);
else
{
update(i*2,a,mid,value);
update(i*2+1,mid+1,b,value);
}
}
void count(int i)
{
if(tree[i].value!=-1)
ans=(tree[i].b -tree[i].a+1)*tree[i].value +ans;
else
{
count(i*2);
count(i*2+1);
}
}
int main()
{
int i,j,t,n,q,x,y,z;
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%d%d",&n,&q);
maketree(1,1,n);
for(j=1;j<=q;j++)
{
scanf("%d%d%d",&x,&y,&z);
update(1,x,y,z);
}
ans=0;
count(1);
printf("Case %d: The total value of the hook is %d.\n",i,ans);
}
return 0;
}
#include<string.h>
struct node
{
int a,b,value;
}tree[300005];
int ans;
void maketree(int i,int a,int b)
{
tree[i].a=a;
tree[i].b=b;
tree[i].value =1;
if(a==b)
return;
int mid=(a+b)/2;
maketree(i*2,a,mid);
maketree(i*2+1,mid+1,b);
}
void update(int i,int a,int b,int value)
{
if(tree[i].value ==value)
return;
if(tree[i].a ==a && tree[i].b==b)
{
tree[i].value =value;
return;
}
if(tree[i].value !=-1)
{
tree[i*2+1].value =tree[i*2].value =tree[i].value ;
tree[i].value =-1;
}
int mid=(tree[i].a+tree[i].b)/2;
if(a>mid)
update(i*2+1,a,b,value);
else if(b<=mid)
update(i*2,a,b,value);
else
{
update(i*2,a,mid,value);
update(i*2+1,mid+1,b,value);
}
}
void count(int i)
{
if(tree[i].value!=-1)
ans=(tree[i].b -tree[i].a+1)*tree[i].value +ans;
else
{
count(i*2);
count(i*2+1);
}
}
int main()
{
int i,j,t,n,q,x,y,z;
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%d%d",&n,&q);
maketree(1,1,n);
for(j=1;j<=q;j++)
{
scanf("%d%d%d",&x,&y,&z);
update(1,x,y,z);
}
ans=0;
count(1);
printf("Case %d: The total value of the hook is %d.\n",i,ans);
}
return 0;
}
- HDU 1698(Just a Hook )
- hdu(1698)Just a Hook
- hdu 1698 Just a Hook
- hdu 1698 Just a Hook
- Hdu 1698 Just a Hook
- hdu 1698 Just a Hook
- hdu 1698 just a hook
- hdu 1698 Just a Hook
- HDU 1698 Just a Hook
- hdu 1698 Just a Hook
- hdu 1698 Just a Hook
- hdu 1698 Just a Hook
- hdu 1698 Just a Hook
- HDU-1698-Just a Hook
- hdu 1698 Just a Hook
- hdu 1698 Just a Hook
- HDU 1698 Just a Hook
- HDU 1698 - Just a Hook
- 删除开机启动项
- 应用点===
- C#中不常用的数据结构
- 电影并不是演戏
- SAP BW_PA_文件_特征数据——视频学习笔记13
- HDU 1698(Just a Hook )
- Java堆内存的10个要点
- Could not instantiate bean class [com.wms.web.action.inquiry.ItemQueryAction]: Constructor threw exc
- AndroidPN环境建立
- spring学习总结
- OD在Windows 7 x64下无法调试的原因
- Android培训班(93)内核解压过程6
- 用户sa登录失败,该用户与可信sql server连接无关联
- SAP BW_PA_文件_层级数据——视频学习笔记14