[线段树实现区间最值]HDU5306 Gorgeous Sequence

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=5306

Gorgeous Sequence

Problem Description

There is a sequence $a$ of length $n$. We use $a_i$ to denote the $i$-th element in this sequence. You should do the following three types of operations to this sequence.

$0xyt$: For every $x\le i\le y$, we use $min(a_i,t)$ to replace the original $a_i$'s value.
$1xy$: Print the maximum value of $a_i$ that $x\le i\le y$.
$2xy$: Print the sum of $a_i$ that $x\le i\le y$.

Input

The first line of the input is a single integer $T$, indicating the number of testcases.

The first line contains two integers n and m denoting the length of the sequence and the number of operations.

The second line contains n separated integers $a_1,\cdots ,a_n(\forall 1\le i\le n,0\le a_i<2^{31})$.

Each of the following m lines represents one operation $(1\le x\le y\le n,0\le t<2^{31})$.

It is guaranteed that $T=100,\sum n\le 1000000,\sum m\le 1000000$.

Output

For every operation of type $1$ or $2$, print one line containing the answer to the corresponding query.

Sample Input

1
5 5
1 2 3 4 5
1 1 5
2 1 5
0 3 5 3
1 1 5
2 1 5

Sample Output

5
15
3
12

Hint

Please use efficient IO method

Author

XJZX

Source

2015 Multi-University Training Contest 2

Recommend

wange2014 | We have carefully selected several similar problems for you: 6937 6936 6935 6934 6933

题目大意

对长度为$n$的数列 { a i } \{a_i\} {ai​}进行$m$次操作，共有三种类型的操作：

$0xyt$: 对所有的$a_i,x\le i\le y$, 将$a_i$变为$min(a_i,t)$。
$1xy$: 输出区间$[x,y]$中最大的$a_i$的值。
$2xy$: 输出${\sum }_{i=x}^y{a}_i$。

题解

除了维护区间和$sum$、最大值$mx$这两个常规操作，为了使复杂度达到$lo{g}_{2}n$级别，我们还需要维护每个区间的严格次大值$se$以及最大值的个数$cot$。

当$t\ge mx$时，操作无效直接返回；
当$se<t<mx$时，直接计算出区间和$sum-=(mx-t)\times vot$，再更新最大值；
当$t\ge se$时，无法快速更新，直接向下递归更新再向上合并。

可以发现，整个算法的最大复杂度在于第三类情况。不过我们可以这样考虑：在整个长度为$n$的数列 { a i } \{a_i\} {ai​}里，不同的数至多有$n$个，每当出现第三种情况时，至少最大值和次大值都会变成$t$，即至少有两个数会变成相同的。而整棵线段树所有节点一共有$nlo{g}_{2}n$个，所以最多这么多次操作后，整棵线段树的节点值的最大值都会变成一样的，严格次大值为$0$。再加上其他操作的复杂度，可以得到整个算法的总复杂度不会超过$O((n+m)\times lo{g}_{2}n)$。

据说可以证明复杂度是$O(mlo{g}_{2}n)$的，但博主不会……

代码

退役老咸鱼含泪复习线段树……

以及这是第二次多组询问用$memset$结果$\mathcal{T}\mathcal{L}\mathcal{E}$了……

#include<bits/stdc++.h>
#define ls v<<1
#define rs v<<1|1
using namespace std;
const int M=1e6+5;
struct node{
    int le,ri,mx,se,cot,mn;
    long long sum;
}tree[M<<2];
int T,n,m,que[M];
int read()
{
    int r=0;char c=getchar();
    for(;!isdigit(c);c=getchar());
    for(;isdigit(c);c=getchar())r=(r<<3)+(r<<1)+c-'0';
    return r;
}
void up(int v)
{
    tree[v].sum=tree[ls].sum+tree[rs].sum;
    tree[v].mx=max(tree[ls].mx,tree[rs].mx);
    if(tree[ls].mx==tree[rs].mx)
    {
        tree[v].cot=tree[ls].cot+tree[rs].cot;
        tree[v].se=max(tree[ls].se,tree[rs].se);
    }
    else if(tree[ls].mx>tree[rs].mx)
    {
        tree[v].cot=tree[ls].cot;
        tree[v].se=max(tree[ls].se,tree[rs].mx);
    }
    else
    {
        tree[v].cot=tree[rs].cot;
        tree[v].se=max(tree[rs].se,tree[ls].mx);
    }
}
void push(int v,int mn)
{
    if(tree[v].mx<mn)return;
    tree[v].sum-=1ll*(tree[v].mx-mn)*tree[v].cot;
    tree[v].mx=tree[v].mn=mn;
}
void down(int v)
{
    if(tree[v].mn>=0)
    {
        push(ls,tree[v].mn);
        push(rs,tree[v].mn);
        tree[v].mn=-1;
    }
}
void build(int v,int le,int ri)
{
    tree[v].le=le,tree[v].ri=ri;
    tree[v].mn=-1;
    if(le==ri)
    {
        tree[v].cot=1;
        tree[v].se=0;
        tree[v].sum=tree[v].mx=que[le];
        return;
    }
    int mid=le+ri>>1;
    build(ls,le,mid),build(rs,mid+1,ri);
    up(v);
}
void qmin(int v,int le,int ri,int t)
{
    if(t>=tree[v].mx)return;
    if(le<=tree[v].le&&tree[v].ri<=ri&&tree[v].se<t)
    {
        tree[v].sum-=1ll*(tree[v].mx-t)*tree[v].cot;
        tree[v].mx=tree[v].mn=t;
        return;
    }
    down(v);
    int mid=tree[v].le+tree[v].ri>>1;
    if(le<=mid)qmin(ls,le,ri,t);
    if(mid<ri)qmin(rs,le,ri,t);
    up(v);
}
int askmax(int v,int le,int ri)
{
    if(le<=tree[v].le&&tree[v].ri<=ri)return tree[v].mx;
    int mid=tree[v].le+tree[v].ri>>1,re=0;
    down(v);
    if(le<=mid)re=askmax(ls,le,ri);
    if(mid<ri)re=max(re,askmax(rs,le,ri));
    return re;
}
long long asksum(int v,int le,int ri)
{
    if(le<=tree[v].le&&tree[v].ri<=ri)return tree[v].sum;
    int mid=tree[v].le+tree[v].ri>>1;
    long long re=0;
    down(v);
    if(le<=mid)re=asksum(ls,le,ri);
    if(mid<ri)re+=asksum(rs,le,ri);
    return re;
}
void in()
{
    //memset(tree,0,sizeof(tree));
    //scanf("%d%d",&n,&m);
    n=read(),m=read();
    for(int i=1;i<=n;++i)que[i]=read();//scanf("%d",&que[i]);
}
void ac()
{
    build(1,1,n);
    for(int i=1,op,x,y;i<=m;++i)
    {
        //scanf("%d%d%d",&op,&x,&y);
        op=read(),x=read(),y=read();
        if(!op)
        {
            //scanf("%d",&op);
            op=read();
            qmin(1,x,y,op);
        }
        else if(op-1)printf("%lld\n",asksum(1,x,y));
        else printf("%d\n",askmax(1,x,y));
    }
}
int main()
{
    scanf("%d",&T);
    for(;T;--T)in(),ac();
    //system("pause");
}