hdu 1698 Just a Hook 线段树区域更新

分析：
*每个线段树的结点存储该结点所代表区间的颜色d[v].c，如果该区间全为同样的颜色，则用一个正数(1,2,3)表示，如果含有多种颜色，则用0表示，
*每次执行染色操作时，如果所要染的颜色与区间颜色一样，则停止，如果所要染区间跟当前结点区间一致，则直接将所要染颜色赋给当前结点的d[v].c,
*否则，如果当前结点区间不是混合色，则先将当前结点的颜色赋给左右子结点lc(2*v)和rc(2*v+1),并递归下去。
code_1:

Description

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. 

 

Input

The input consists of several test cases. The first line of the input is the number of the cases. There are no more than 10 cases. 
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. 

 

Output

For each case, print a number in a line representing the total value of the hook after the operations. Use the format in the example. 

 

Sample Input

    
    

     
      1
10
2
1 5 2
5 9 3 
    
    

 

Sample Output

    
    

     
      Case 1: The total value of the hook is 24.
        
    
    

 

#include<cstdio>
#include<iostream>
#include<algorithm>
using  namespace std;
int sum[2222222];
int tree[2000000];
void build(int left,int right ,int root)
{
    sum[root]=0;
    int mid=(left+right)>>1;
    if(left==right)
        {
            tree[root]=1;
            return ;
        }
    build(left,mid,root<<1);
    build(mid+1,right,root<<1|1);
    tree[root]=tree[root<<1]+tree[root<<1|1];
}
void pushdown(int left, int right ,int mid,int root)
{
    if(sum[root])
    {
        sum[root<<1]=sum[root<<1|1]=sum[root];
        tree[root<<1]=sum[root]*(mid-left+1);
        tree[root<<1|1]=sum[root]*(right-mid);
        sum[root]=0;
    }
}
 void update(int a,int b,int d,int left,int right,int root)
 {
     int mid=(left+right)>>1;
     if(a<=left&&b>=right)
     {
         sum[root]=d;
         tree[root]=d*(right-left+1);
         return ;
     }
     pushdown(left,right,mid,root);
     if(a<=mid)
     update(a,b,d,left,mid,root<<1);
     if(b>mid)
        update(a,b,d,mid+1,right,root<<1|1);
     tree[root]=tree[root<<1]+tree[root<<1|1];
 }
int main()
{
    int t,n,m;
    int a,b,c;
    int num=1;
    while(~scanf("%d",&t))
    {
        while(t--)
        {
            scanf("%d",&n);
            build(1,n,1);
            scanf("%d",&m);
            while(m--)
            {
                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",num++,tree[1]);
        }
    }
    return 0;
}

线段树区间更新问题