【bzoj3745】[Coci2015]Norma

Description

Input

第1行，一个整数N；
第2~n+1行，每行一个整数表示序列a。
Output

输出答案对10^9取模后的结果。
Sample Input

4

2

4

1

4
Sample Output

109

【数据范围】

N <= 500000

1 <= a_i <= 10^8

题解
分治。
去中间数，把区间分为两段，利用前缀和单调性等优化至nlogn

代码

#include<bits/stdc++.h>
typedef long long ll;
const int mod=1000000000;
const int N=500005;
using namespace std;
inline int read()
{
    int 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();}
    return x*f;
}
int n;
ll ans,a[N],mn[N],mx[N],sum_mn[N],sum_mx[N];
ll sum_mn_mul[N],sum_mx_mul[N],fac[N];
ll SUM[N],SUM_mul[N];
void solve(int l,int r)
{
    if (l>r) return;
    int mid=(l+r)>>1;
    solve(l,mid-1);solve(mid+1,r);
    for (int i=l;i<=r;i++) mn[i]=mx[i]=sum_mn[i]=sum_mx[i]=sum_mx_mul[i]=sum_mn_mul[i]=SUM[i]=SUM_mul[i]=0;
    mn[mid]=mx[mid]=a[mid];
    for (int i=mid-1;i>=l;i--)
    {
        mn[i]=min(mn[i+1],a[i]);
        mx[i]=max(mx[i+1],a[i]);
    }
    for (int i=mid+1;i<=r;i++)
    {
        mn[i]=min(mn[i-1],a[i]);
        mx[i]=max(mx[i-1],a[i]);
        sum_mn[i]=(sum_mn[i-1]+mn[i])%mod;
        sum_mx[i]=(sum_mx[i-1]+mx[i])%mod;
        sum_mn_mul[i]=(sum_mn_mul[i-1]+mn[i]*(i-mid))%mod;
        sum_mx_mul[i]=(sum_mx_mul[i-1]+mx[i]*(i-mid))%mod;
        SUM[i]=(SUM[i-1]+mn[i]*mx[i])%mod;
        SUM_mul[i]=(SUM_mul[i-1]+mn[i]*mx[i]%mod*(i-mid))%mod;
    }
    int p_mn=mid,p_mx=mid;
    for (int i=mid;i>=l;i--)
    {
        while (mn[p_mn+1]>=mn[i]&&p_mn<r) p_mn++;
        while (mx[p_mx+1]<=mx[i]&&p_mx<r) p_mx++;
        if (p_mn<p_mx)
        {
            ll L=mid-i+1,R=p_mn-mid;
            ll MN=(mod+sum_mn_mul[p_mx]-sum_mn_mul[p_mn]+(sum_mn[p_mx]-sum_mn[p_mn])*L%mod)%mod;
            ans=(ans+mn[i]*mx[i]%mod*(L*(R+1)%mod+fac[R])%mod)%mod;
            ans=(ans+MN*mx[i]%mod)%mod;
            ans=(ans+(SUM[r]-SUM[p_mx])*L%mod+SUM_mul[r]-SUM_mul[p_mx])%mod;
        }
        else
        {
            ll L=mid-i+1,R=p_mx-mid;
            ll MX=(mod+sum_mx_mul[p_mn]-sum_mx_mul[p_mx]+(sum_mx[p_mn]-sum_mx[p_mx])*L%mod)%mod;
            ans=(ans+mn[i]*mx[i]%mod*(L*(R+1)%mod+fac[R])%mod)%mod;
            ans=(ans+MX*mn[i]%mod)%mod;
            ans=(ans+(SUM[r]-SUM[p_mn])*L%mod+SUM_mul[r]-SUM_mul[p_mn])%mod;
        }
    }
}
int main()
{
    n=read();
    for (int i=1;i<=n;i++) a[i]=read(),fac[i]=(fac[i-1]+i)%mod;
    solve(1,n);
    cout<<((ans+mod)%mod);
    return 0;
}