Gorgeous Sequence

 http://acm.hdu.edu.cn/showproblem.php?pid=5306

#include<algorithm>
#include<set>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

struct node
{
    ll val;
    int se;
    int Max;
    int Max_num;

}tree[maxn*4];
int n,q;

void pushup(int rt)
{
    tree[rt].val=tree[rt<<1].val+tree[rt<<1|1].val;
    tree[rt].Max=max(tree[rt<<1].Max,tree[rt<<1|1].Max);
    tree[rt].se=max(tree[rt<<1].se,tree[rt<<1|1].se);
    tree[rt].Max_num=0;
    if(tree[rt<<1].Max!=tree[rt<<1|1].Max) tree[rt].se=max(tree[rt].se,min(tree[rt<<1].Max,tree[rt<<1|1].Max));
    if(tree[rt].Max==tree[rt<<1].Max) tree[rt].Max_num+=tree[rt<<1].Max_num;
    if(tree[rt].Max==tree[rt<<1|1].Max) tree[rt].Max_num+=tree[rt<<1|1].Max_num;
}
void dec(int rt,int val)
{
    if(val>=tree[rt].Max) return ;
    tree[rt].val+=(ll)(val-tree[rt].Max)*tree[rt].Max_num;
    tree[rt].Max=val;
}
void pushdown(int rt)
{
    dec(rt<<1,tree[rt].Max);
    dec(rt<<1|1,tree[rt].Max);
}
void build(int le,int ri,int rt)
{
    tree[rt].Max=0;
    tree[rt].Max_num=0;
    tree[rt].se=-1;
    if(le==ri)
    {
        tree[rt].Max_num=1;
        scanf("%lld",&tree[rt].val);
        tree[rt].Max=tree[rt].val;
        return ;
    }
    int mid=(le+ri)>>1;
    build(le,mid,rt<<1);
    build(mid+1,ri,rt<<1|1);
    pushup(rt);
}
void update(int x,int y,int le,int ri,int rt,int val)
{
    if(val>=tree[rt].Max) return ;
    if(x<=le&&y>=ri&&val>tree[rt].se)
    {
        dec(rt,val);
        return ;
    }
    int mid=(le+ri)>>1;
    pushdown(rt);
    if(x<=mid)
    {
        update(x,y,le,mid,rt<<1,val);
    }
    if(y>mid)
    {
        update(x,y,mid+1,ri,rt<<1|1,val);
    }
    pushup(rt);
}
ll Get_Sum(int x,int y,int le,int ri,int rt)
{
    if(x<=le&&y>=ri) return tree[rt].val;
    int mid=(le+ri)>>1;
    pushdown(rt);
    ll ans=0;
    if(x<=mid)
    {
        ans+=Get_Sum(x,y,le,mid,rt<<1);
    }
    if(y>mid)
    {
        ans+=Get_Sum(x,y,mid+1,ri,rt<<1|1);
    }
    return ans;
}
ll Get_Max(int x,int y,int le,int ri,int rt)
{
    if(x<=le&&y>=ri) return tree[rt].Max;
    int mid=(le+ri)>>1;
    pushdown(rt);
    ll ans=0;
    if(x<=mid)
    {
        ans=max(ans,Get_Max(x,y,le,mid,rt<<1));
    }
    if(y>mid)
    {
        ans=max(ans,Get_Max(x,y,mid+1,ri,rt<<1|1));
    }
    return ans;
}
int main()
{
    //FAST_IO;
    int T;
    //cin>>T;
    sfi(T);
    while(T--)
    {
        int n,m;
        //cin>>n>>m;
        sfi(n);
        sfi(m);
        build(1,n,1);
        while(m--)
        {
            int op;
            sfi(op);
            int x,y,t;
            if(op==0)
            {
                sfi(x);
                sfi(y);
                sfi(t);
                //cin>>x>>y>>t;
                update(x,y,1,n,1,t);
            }
            else if(op==1)
            {
                sfi(x);
                sfi(y);
                printf("%d\n",Get_Max(x,y,1,n,1));
                //cin>>x>>y;
                //cout<<Get_Max(x,y)<<endl;
            }
            else
            {
                sfi(x);
                sfi(y);
                printf("%lld\n",Get_Sum(x,y,1,n,1));
                //cin>>x>>y;
                //cout<<Get_Sum(x,y)<<endl;
            }
        }
    }
}