Uva 11992

每行建一棵线段树

 代码在看过别人的模板之后还是没有把自己的修改出  真是太弱了  做线段树专题的时候再回来修改

首先是错误的模板：

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define mid ((L+R)>>1)
#define ls (i<<1)
#define rs ((i<<1)|1)
#define M 100005
int addv[M<<2],setv[M<<2];
int sum[M<<2],minn[M<<2],maxx[M<<2];
int l,r;
void pushup(int i,int L,int R)
{
    if(L<R)
    {
          sum[i]+=sum[ls]+sum[rs];
          minn[i]=min(minn[ls],minn[rs]);
            maxx[i]=max(maxx[ls],maxx[rs]);
    } 
    if(setv[i]>=0)
      {sum[i]=setv[i]*(R-L+1); maxx[i]=setv[i]; minn[i]=setv[i];}
    if(addv[i]>0)
      {sum[i]+=addv[i]*(R-L+1); maxx[i]+=addv[i]; minn[i]+=addv[i];}
    
}
void pushdown(int i)
{
    if(setv[i]>=0)
    {
        setv[ls]=setv[rs]=setv[i];
        addv[ls]=addv[rs]=0;
        setv[i]=-1;
    }
    if(addv[i]>0)
    {
        addv[ls]+=addv[i];
        addv[rs]+=addv[i];
        addv[i]=0;
    }
}
void add(int i,int L,int R,int v)
{
    if(L>r||R<l) return ;
    if(l<=L&&R<=r)
    {
        addv[i]+=v;
    }
    else
    {
        pushdown(i);
        if(mid>=l){add(ls,L,mid,v);}else{pushup(ls,L,mid);}
        if(mid<r){add(rs,mid+1,R,v);}else{pushup(rs,mid+1,R);}
    }
    pushup(i,L,R);
}
void set(int i,int L,int R,int v)
{
    if(L>r||R<l) return ;
    if(l<=L&&R<=r)
    {
        setv[i]=v;
    }
    else
    {
        pushdown(i);
        if(mid>=l){set(ls,L,mid,v);}else{pushup(ls,L,mid);}
        if(mid<r){set(rs,mid+1,R,v);}else{pushup(rs,mid+1,R);}
    }
    pushup(i,L,R);
}
int _sum,_min,_max;
void query(int i,int L,int R)
{
    if(L>r||R<l) return ;
    if(l<=L&&R<=r)
    {
        pushup(i,L,R);
        _sum+=sum[i];
         _max=max(_max,maxx[i]);
          _min=min(_min,minn[i]);
    }
    else
    {
        pushdown(i);
        if(mid>=l)query(ls,L,mid);
          else{pushup(ls,L,mid);}
        if(mid<r)query(rs,mid+1,R);
          else{pushup(rs,mid+1,R);}
    }
}
#define INF 100000000
int main()
{
    char ch;
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        memset(addv,0,sizeof addv);
        memset(setv,-1,sizeof setv);
        memset(sum,0,sizeof sum);
        for(int i=1;i<=(n<<2);i++)
        {minn[i]=INF;maxx[i]=-INF;}
        int va;
        for(int i=0;i<m;i++)
        {
            scanf(" %c",&ch);
            if(ch=='A')
            {scanf("%d%d%d",&l,&r,&va);add(1,1,n,va);}
            if(ch=='S')
            {scanf("%d%d%d",&l,&r,&va);set(1,1,n,va);}
            if(ch=='Q')
            {
                scanf("%d%d",&l,&r);
                _sum=0;
                _max=INF;
                _min=-INF;
                query(1,1,n);
                printf("%d %d %d\n",_sum,_max,_min);
            }
        }
    }
    return 0;
}

然后是正确的代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#define inf 0x3f3f3f3f
#define Inf 0x3FFFFFFFFFFFFFFFLL
#define eps 1e-9
#define pi acos(-1.0)
#define ls (rt<<1)
#define rs ((rt<<1)|1)
#define mid ((l+r)>>1)
using namespace std;
const int maxn=100010<<2;
int setv[30][maxn],addv[30][maxn],sum[30][maxn],maxnum[30][maxn],minnum[30][maxn];
void pushup(int num,int rt)
{
    sum[num][rt]=sum[num][ls]+sum[num][rs];
    maxnum[num][rt]=max(maxnum[num][ls],maxnum[num][rs]);
    minnum[num][rt]=min(minnum[num][ls],minnum[num][rs]);
}
void pushdown(int num,int l,int r,int rt)
{
    if(setv[num][rt]>0)
    {
        setv[num][ls]=setv[num][rs]=setv[num][rt];
        addv[num][ls]=addv[num][rs]=0;
        sum[num][ls]=(mid-l+1)*setv[num][rt];
        sum[num][rs]=(r-mid)*setv[num][rt];
        maxnum[num][ls]=maxnum[num][rs]=setv[num][rt];
        minnum[num][ls]=minnum[num][rs]=setv[num][rt];
        setv[num][rt]=-1;
    }
    if(addv[num][rt]>0)
    {
        addv[num][ls]+=addv[num][rt];
        addv[num][rs]+=addv[num][rt];
        sum[num][ls]+=(mid-l+1)*addv[num][rt];
        sum[num][rs]+=(r-mid)*addv[num][rt];
        maxnum[num][ls]+=addv[num][rt];
        maxnum[num][rs]+=addv[num][rt];
        minnum[num][ls]+=addv[num][rt];
        minnum[num][rs]+=addv[num][rt];
        addv[num][rt]=0;
    }
}
void build(int num,int l,int r,int rt)
{
    setv[num][rt]=-1;
    addv[num][rt]=0;
    if(l==r)
    {
        sum[num][rt]=maxnum[num][rt]=minnum[num][rt]=0;
        return;
    }
    build(num,l,mid,ls);
    build(num,mid+1,r,rs);
    pushup(num,rt);
}
void update(int num,int type,int value,int L,int R,int l,int r,int rt)  //单点则L=R
{
    if(l>=L&&r<=R)
    {
        if(type==1)                                          //add
        {
            addv[num][rt]+=value;
            sum[num][rt]+=(r-l+1)*value;
            minnum[num][rt]+=value;
            maxnum[num][rt]+=value;
        }
        if(type==0)                                        //set
        {
            addv[num][rt]=0;
            setv[num][rt]=value;
            sum[num][rt]=(r-l+1)*value;
            minnum[num][rt]=maxnum[num][rt]=value;
        }
        return;
    }
    pushdown(num,l,r,rt);
    if(mid>=L)
        update(num,type,value,L,R,l,mid,ls);
    if(mid<R)
        update(num,type,value,L,R,mid+1,r,rs);
    pushup(num,rt);
}
void query(int num,int L,int R,int l,int r,int rt,int& s,int& maxv,int& minv)
{
    if(l>=L&&r<=R)
    {
        s=sum[num][rt];
        maxv=maxnum[num][rt];
        minv=minnum[num][rt];
        return;
    }
    pushdown(num,l,r,rt);
    int tsum,tminv,tmaxv;
    s=0;
    maxv=-1;
    minv=inf;
    if(mid>=L)
    {
        query(num,L,R,l,mid,ls,tsum,tmaxv,tminv);
        s+=tsum;
        maxv=max(maxv,tmaxv);
        minv=min(minv,tminv);
    }
    if(mid<R)
    {
        query(num,L,R,mid+1,r,rs,tsum,tmaxv,tminv);
        s+=tsum;
        maxv=max(maxv,tmaxv);
        minv=min(minv,tminv);
    }
}
int main()
{
    int m,n,q;
    while(cin>>m>>n>>q)
    {
        for(int i=1;i<=m;++i)
        {
            build(i,1,n,1);
        }
        int type,x1,y1,x2,y2,v;
        while(q--)
        {
            cin>>type;
            if(type==1)
            {
                cin>>x1>>y1>>x2>>y2>>v;
                for(int i=x1;i<=x2;++i)
                    update(i,1,v,y1,y2,1,n,1);
            }
            else if(type==2)
            {
                cin>>x1>>y1>>x2>>y2>>v;
                for(int i=x1;i<=x2;++i)
                    update(i,0,v,y1,y2,1,n,1);
            }
            else
            {
                cin>>x1>>y1>>x2>>y2;
                int s=0,minv=inf,maxv=-1;
                int ts,tmin,tmax;
                for(int i=x1;i<=x2;++i)
                {
                    query(i,y1,y2,1,n,1,ts,tmax,tmin);
                    s+=ts;
                    maxv=max(maxv,tmax);
                    minv=min(minv,tmin);
                }
                cout<<s<<" "<<minv<<" "<<maxv<<endl;
            }
        }
    }
    return 0;
}

关键点在于pushup的时候按白书上的那个不知道要怎么写了 求指导