#include<bits/stdc++.h>
using namespace std;
typedef int ll;
const int N=100000+5;
int a[N];
struct Tree
{
int left,right;
ll sum,f;
}tree[4*N+10];
void build(int id,int l,int r)
{
tree[id].left=l;
tree[id].right=r;
tree[id].f=-1;
if (l==r)
tree[id].sum=1;
else
{
int mid=(l+r)/2;
build(id*2,l,mid);
build(id*2+1,mid+1,r);
tree[id].sum=tree[id*2].sum+tree[id*2+1].sum;
}
}
void pushdown(int id)
{
if(tree[id].f!=-1)
{
tree[id*2].f=tree[id*2+1].f=tree[id].f;
tree[id*2].sum=tree[id].f*(tree[id*2].right-tree[id*2].left+1);
tree[id*2+1].sum=tree[id].f*(tree[id*2+1].right-tree[id*2+1].left+1);
tree[id].f=-1;
}
}
void update(int id,int l,int r, ll val)
{
if (l<=tree[id].left&&tree[id].right<=r)
{
tree[id].f=val;
tree[id].sum=val*(tree[id].right-tree[id].left+1);
}
else
{
pushdown(id);
int mid=(tree[id].left+tree[id].right)/2;
if(l<=mid) update(id*2,l,r,val);
if(r>mid) update(id*2+1,l,r,val);
tree[id].sum=tree[id*2].sum+tree[id*2+1].sum;
}
}
int main()
{
int _,i,n,x,y,z,m,cas=0;
scanf("%d",&_);
while(_--)
{
scanf("%d",&n);
scanf("%d",&m);
build(1,1,n);
for(i=0;i<m;i++)
{
scanf("%d%d%d",&x,&y,&z);
update(1,x,y,z);
}
printf("Case %d: The total value of the hook is %d.\n",++cas,tree[1].sum);
}
return 0;
}
hdu 1684 Just a Hook 线段树-区间修改
最新推荐文章于 2022-01-09 22:50:36 发布