hdu 1698 Just a Hook

题目链接：点这里

【题意】

这个人有一根长长的。。。这个长长的。。。可以看作是很多短短的。。。组成的。每一段都有自己固定的价值（长度乘以单价）。其中初始价值为1，问你经过修改后价值是多少？其中单价只能是1~3.

【分析】

红果果的线段树裸题啊。区间更新求和。套模板就行。

【代码】

#include<iostream>#include<cstdio>#include<cstring>#include<string.h>#include<algorithm>#include<vector>#include<cmath>#include<stdlib.h>#include<time.h>#include<stack>#include<set>#include<map>#include<queue>#include<sstream>using namespace std;#define rep0(i,l,r) for(int i = (l);i < (r);i++)#define rep1(i,l,r) for(int i = (l);i <= (r);i++)#define rep_0(i,r,l) for(int i = (r);i > (l);i--)#define rep_1(i,r,l) for(int i = (r);i >= (l);i--)#define MS0(a) memset(a,0,sizeof(a))#define MS1(a) memset(a,-1,sizeof(a))#define MSi(a) memset(a,0x3f,sizeof(a))#define sin1(a) scanf("%d",&(a))#define sin2(a,b) scanf("%d%d",&(a),&(b))#define sll(a) scanf("%lld",&(a))#define sll2(a,b) scanf("%lld%lld",&(a),&(b))#define sdo(a) scanf("%lf",&(a))#define sdo2(a,b) scanf("%lf%lf",&(a),&(b))#define inf 0x3f3f3f3f#define lson l, m, rt << 1#define rson m+1, r, rt << 1|1#define uint unsigned inttypedef pair<int,int> PII;#define A first#define B second#define pb push_back#define MK make_pair#define ll long longtemplate<typename T>void read1(T &m){    T x=0,f=1;    char ch=getchar();    while(ch<'0'||ch>'9')    {        if(ch=='-')f=-1;        ch=getchar();    }    while(ch>='0'&&ch<='9')    {        x=x*10+ch-'0';        ch=getchar();    }    m = x*f;}template<typename T>void read2(T &a,T &b){    read1(a);    read1(b);}template<typename T>void read3(T &a,T &b,T &c){    read1(a);    read1(b);    read1(c);}template<typename T>void out(T a){    if(a>9) out(a/10);    putchar(a%10+'0');}template<typename T>void outn(T a){    if(a>9) out(a/10);    putchar(a%10+'0');    puts("");}using namespace std;const int maxm=1e5+10;struct node{    int l,r;    int lazy;    int sum;}segTree[maxm<<2];void build(int i,int l,int r){    segTree[i].l=l;    segTree[i].r=r;    segTree[i].lazy=0;    if(l==r)    {        segTree[i].sum=1;        return ;    }    int mid=(l+r)>>1;    build(i<<1,l,mid);    build(i<<1|1,mid+1,r);    segTree[i].sum=segTree[i<<1].sum+segTree[i<<1|1].sum;}void update(int i,int l,int r,int v){    if(segTree[i].l==l&&segTree[i].r==r)    {        segTree[i].lazy=v;        segTree[i].sum=(r-l+1)*v;        return ;    }    int mid=(segTree[i].l+segTree[i].r)>>1;    if(segTree[i].lazy)    {        update(i<<1,segTree[i].l,mid,segTree[i].lazy);        update(i<<1|1,mid+1,segTree[i].r,segTree[i].lazy);        segTree[i].lazy=0;    }    if(r<=mid)        update(i<<1,l,r,v);    else if(l>mid)        update(i<<1|1,l,r,v);    else    {        update(i<<1,l,mid,v);        update(i<<1|1,mid+1,r,v);    }    segTree[i].sum=segTree[i<<1].sum+segTree[i<<1|1].sum;}int main(){//    freopen("in.txt","r",stdin);    int T;    read1(T);    rep1(z,1,T)    {        int len,que;        read2(len,que);        build(1,1,len);        int a,b,c;        while(que--)        {            read3(a,b,c);            update(1,a,b,c);        }        printf("Case %d: The total value of the hook is %d.\n",z,segTree[1].sum);    }    return 0;}