cf 444C.

听说这是线段树的裸题？？（看来我也就能搞个求和什么的了2333）

 #include<bits/stdc++.h>
 #define INF 0x7fffffff
 #define LL long long
 #define N 100005
 using namespace std;
 inline int ra()
 {
     int x=,f=; char ch=getchar();
     while (ch<'' || ch>'') {if (ch=='-') f=-; ch=getchar();}
     while (ch>='' && ch<='') {x=x*+ch-''; ch=getchar();}
     return x*f;
 }
 LL s[N<<],del[N<<],mark[N<<];
 void build(int k, int l, int r)
 {
     if (l==r)
     {
         mark[k]=l;
         return;
     }
     int mid=(l+r)>>;
     build(k<<,l,mid); build(k<<|,mid+,r);
 }
 LL query(int k, int l, int r, int x, int y)
 {
     if (y<l || x>r) return ;
     if (x<=l && r<=y) return s[k];
     int mid=l+r>>;
     LL L=query(k<<,l,mid,x,y);
     LL R=query(k<<|,mid+,r,x,y);
     return L+R+max(,min(r,y)-max(l,x)+)*del[k];
 }
 void clear(int k, int l, int r, int val)
 {
     if (mark[k])
     {
         del[k]+=abs(mark[k]-val);
         s[k]+=1LL*(r-l+)*abs(mark[k]-val);
         mark[k]=;
     }
     else
     {
         if (l==r) return;
         int mid=l+r>>;
         clear(k<<,l,mid,val);
         clear(k<<|,mid+,r,val);
         s[k]=s[k<<]+s[k<<|]+1LL*(r-l+)*del[k];
     }
 }
 void change(int k, int l, int r, int x, int y, int val)
 {
     if (y<l || x>r) return;
     if (x<=l && r<=y)
     {
         clear(k,l,r,val);
         mark[k]=val;
         return;
     }
     int mid=l+r>>;
     if (mark[k])
     {
         mark[k<<]=mark[k<<|]=mark[k];
         mark[k]=;
     }
     change(k<<,l,mid,x,y,val);
     change(k<<|,mid+,r,x,y,val);
     s[k]=s[k<<]+s[k<<|]+1LL*(r-l+)*del[k];
 }
 int main()
 {
     int n=ra(),m=ra();
     build(,,n);
     while (m--)
     {
         int type=ra();
         if (type==)
         {
             int x=ra(),y=ra(),v=ra();
             change(,,n,x,y,v);
         }
         else
         {
             int x=ra(),y=ra();
             printf("%I64d\n",query(,,n,x,y));
         }
     }
     return ;
 }