【BZOJ3745】【COCI2015】Norma（分治）

Description

---

Solution

考虑分治，假设我们现在分治到区间$[l,r]$，区间中点为$mid$，那么只要计算跨过中间的区间的贡献即可。

我们用一个$x$从$mid$向$l$枚举，设$\min \limits_{i=x}^{mid}a_i=A，\max \limits_{i=x}^{mid}a_i=B$。
我们维护两个指针$p,q$从$mid$向右移动，$p$维护最右到哪个位置满足$\min\limits _{i=mid+1}^{p}a_i \ge A$；同理，$q$维护最右到哪个位置满足$\max\limits _{i=mid+1}^{q}a_i \le B$。
对于当前的左端点$x$，我们将右区间分为$3$段（这里假设$p\le q$，$q<p同理$）：
1. 对于$y \le p$，最小值为$A$，最大值为$B$，可直接求和。
2. 对于$p<y\le q$，最大值为$B$，最小值未知，我们要算的贡献是：$\sum\limits _{y=p+1}^q B(y-x+1)\max\limits_{i=mid+1}^y a_i$。我们预处理出$\max\limits_{i=mid+1}^y a_i,\max\limits_{i=mid+1}^y i\times a_i$的前缀和即可。
（同理要预处理$\min\limits_{i=mid+1}^y a_i,\min\limits_{i=mid+1}^y i\times a_i$的前缀和）
3. $q<y$时，贡献为$\sum\limits_{y=q+1}^r (y-x+1))\max\limits_{i=mid+1}^y a_i\min\limits_{i=mid+1}^y a_i$，我们预处理出$\max\limits_{i=mid+1}^y a_i\min\limits_{i=mid+1}^y a_i$和$\max\limits_{i=mid+1}^y a_i\min\limits_{i=mid+1}^y a_i\times i$的前缀和即可。

---

Solution

/************************************************
 * Au: Hany01
 * Date: Aug 17th, 2018
 * Prob: BZOJ3745 COCI2015 Norma
 * Email: hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 5e5 + 3, MOD = 1e9;

int n, a[maxn], mn[maxn], mx[maxn], mnid[maxn], mxid[maxn], mnmx[maxn], mnmxid[maxn], Ans;

inline int ad(int x, int y) { if ((x += y) >= MOD) return x - MOD; return x; }

void DivideAndConquer(int l, int r)
{
    if (l == r) { Ans = ad(Ans, (LL)a[l] * a[l] % MOD); return; }

    int mid = (l + r) >> 1;
    DivideAndConquer(l, mid), DivideAndConquer(mid + 1, r);

    register int p = mid, q = mid, A = INF, B = -INF, minpq, maxpq, Min = INF, Max = -INF;

    mn[mid] = mnid[mid] = mx[mid] = mxid[mid] = mnmx[mid] = mnmxid[mid] = 0;
    For(i, mid + 1, r) {
        chkmin(Min, a[i]), chkmax(Max, a[i]);
        mn[i] = ad(mn[i - 1], Min), mnid[i] = ad(mnid[i - 1], (LL)Min * i % MOD);
        mx[i] = ad(mx[i - 1], Max), mxid[i] = ad(mxid[i - 1], (LL)Max * i % MOD);
        mnmx[i] = ad(mnmx[i - 1], (LL)Min * Max % MOD), mnmxid[i] = ad(mnmxid[i - 1], (LL)Min * Max % MOD * i % MOD);
    }

    Fordown(x, mid, l) {
        chkmax(B, a[x]), chkmin(A, a[x]);
        while (p < r && a[p + 1] >= A) ++ p;
        while (q < r && a[q + 1] <= B) ++ q;
        minpq = min(p, q), maxpq = max(p, q);
        if (mid < minpq) Ans = ad(Ans, (LL)(mid + 1 - x + 1 + minpq - x + 1) * (minpq - mid) / 2 % MOD * A % MOD * B % MOD);
        if (minpq < maxpq) {
            if (p < q) Ans = ad(Ans, (LL)B * ad(ad(mnid[maxpq], MOD - mnid[minpq]), MOD - (LL)ad(mn[maxpq], MOD - mn[minpq]) * (x - 1) % MOD) % MOD);
            else       Ans = ad(Ans, (LL)A * ad(ad(mxid[maxpq], MOD - mxid[minpq]), MOD - (LL)ad(mx[maxpq], MOD - mx[minpq]) * (x - 1) % MOD) % MOD);
        }
        Ans = ad(Ans, ad(ad(mnmxid[r], MOD - mnmxid[maxpq]), MOD - (LL)(x - 1) * ad(mnmx[r], MOD - mnmx[maxpq]) % MOD));
    }
}

int main()
{
#ifdef hany01
    freopen("bzoj3745.in", "r", stdin);
    freopen("bzoj3745.out", "w", stdout);
#endif

    For(i, 1, n = read()) a[i] = read();
    DivideAndConquer(1, n), printf("%d\n", Ans);

    return 0;
}