Just a Hook - 线段树（改变区间的值）

 

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. 

InputThe 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. 
OutputFor 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.

分析：

这道题不同之处是要改变区间的值，需要有一个push_down函数，每次改变k对应的左右子树的值，这题的比较简单之处是，

它让求的永远是1到n的数之和，所以我们只要输出sum[1]就可以了，不用把下面的每个值都更新一遍，只要保证sum[1]是

正确的结果即可。

代码如下：

#include<iostream>
#include<cstdio>

using namespace std;

#define lson l,m,k<<1
#define rson m+1,r,k<<1|1

const int N=100000+5;
int sum[N<<2],col[N<<2];

void push_up(int k){
    sum[k]=sum[k<<1]+sum[k<<1|1];
}

void push_down(int k,int m){//只能更新k结点的左右孩子
    if(col[k]){
        sum[k<<1]=(m-(m>>1))*col[k];
        sum[k<<1|1]=(m>>1)*col[k];
        col[k<<1]=col[k];
        col[k<<1|1]=col[k];
        col[k]=0;
    }
}

void build(int l,int r,int k){
    col[k]=0;//设初始值都不要更新
    if(l==r){
        sum[k]=1;
        return ;
    }
    int m=(l+r)>>1;
    build(lson);
    build(rson);
    push_up(k);
}

void update(int c,int L,int R,int l,int r,int k){
    if(L<=l&&R>=r){
        col[k]=c;
        sum[k]=c*(r-l+1);
        return ;
    }
    push_down(k,r-l+1);
    int m=(l+r)>>1;
    if(L<=m)update(c,L,R,lson);
    if(R>m)update(c,L,R,rson);
    push_up(k);
}

int main(){
    int cas,n,m,a,b,c;
    scanf("%d",&cas);
    for(int i=1;i<=cas;i++){
        scanf("%d%d",&n,&m);
        build(1,n,1);
        while(m--){
            scanf("%d%d%d",&a,&b,&c);
            update(c,a,b,1,n,1);

        }
        printf("Case %d: The total value of the hook is %d.\n",i,sum[1]);
    }
}