hdu 1698 just a hook

题目大意：

  给定一个区间，默认区间的每一个数的权值为1，不断的修改区间的某一范围，求最终的区间权值和

解题思路：

线段树区间修改。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

#define maxn 100010
#define L(a) (a)<<1
#define R(a) (a)<<1|1

struct Node{
	int sum;
	int set;
	int add;
	int lc,rc;
}node[3*maxn];

int ans;

void create(int num,int l,int r)
{
	node[num].lc=l;
	node[num].rc=r;
	if(l==r)
	{
		node[num].sum=1;
		node[num].set=-1;
		node[num].add=0;
		return ;
	}
	int mid=(l+r)>>1;
	create(L(num),l,mid);
	create(R(num),mid+1,r);
	node[num].sum=node[L(num)].sum+node[R(num)].sum;
	node[num].set=-1;
	node[num].add=0;
}

void pushup(int num)
{
	node[num].sum=node[L(num)].sum+node[R(num)].sum;
}

void pushdown(int num)
{
	if(node[num].set!=-1)
	{
		node[L(num)].set=node[R(num)].set=node[num].set;
		node[L(num)].sum=(node[L(num)].rc-node[L(num)].lc+1)*node[num].set;
		node[R(num)].sum=(node[R(num)].rc-node[R(num)].lc+1)*node[num].set;
		node[num].set=-1;
	}
}

void updata(int num,int l,int r,int v)
{
	if(node[num].lc==l&&node[num].rc==r)
	{
		node[num].set=v;
		node[num].sum=(r-l+1)*v;
		return ;
	}
	else
	{
		pushdown(num);
		int mid=(node[num].lc+node[num].rc)>>1;
		if(r<=mid)
		updata(L(num),l,r,v);
		else if(l>mid)
		updata(R(num),l,r,v);
		else
		{
			updata(L(num),l,mid,v);
			updata(R(num),mid+1,r,v);
		}
		pushup(num);
	}
}

void query(int num,int l,int r)
{
	if(node[num].lc>=l&&node[num].rc<=r)
	{
		ans+=node[num].sum;
		return ;
	}
	int mid=(node[num].lc+node[num].rc)>>1;
	if(r<=mid)
	query(L(num),l,r);
	else if(l>mid)
	query(R(num),l,r);
	else
	{
		query(L(num),l,mid);
		query(R(num),mid+1,r);
	}
}

int main()
{
	int t;
	scanf("%d",&t);
	int count=0;
	while(t--)
	{
		int n;
		scanf("%d",&n);
		create(1,1,n);
		int m;
		scanf("%d",&m);
		for(int i=0;i<m;i++)
		{
			int a,b,c;
			scanf("%d%d%d",&a,&b,&c);
			updata(1,a,b,c);
		}
		ans=0;
		query(1,1,n);
		printf("Case %d: The total value of the hook is %d.\n",++count,ans);
	}
}