[HDU-6305] RMQ Similar Sequence

RMQ Similar Sequence http://acm.hdu.edu.cn/showproblem.php?pid=6305

Chiaki has a sequence $A=\{a_1,a_2,\dots,a_n\}$. Let $RMQ(A,l,r)$ be the minimum $i (l≤i≤r)$such that $a_i$ is the maximum value in $a_l,a_{l+1},\dots,a_r$.

Two sequences $A$ and $B$ are called \textit{RMQ Similar}, if they have the same length n and for every $1≤l≤r≤n$, $RMQ(A,l,r)=RMQ(B,l,r)$.

For a given the sequence $A=\{a_1,a_2,\dots,a_n\}$, define the weight of a sequence $B=\{b_1,b_2,\dots,b_n\}$ be ∑i=1nbi (i.e. the sum of all elements in $B$) if sequence $B$ and sequence $A$ are RMQ Similar, or 0 otherwise. If each element of $B$ is a real number chosen independently and uniformly at random between 0 and 1, find the expected weight of $B$.

官方题解

MQ-Similar实际上就是 $A$ 和 $B$ 的笛卡尔树一样，这样我们就有了一个二叉树，然后可以在树上分析了。

考虑到B中有元素相同的概率是 $0$ ，于是可以假设 $B$ 里面元素互不相同，也就是说可以假定是一个排列。

显然，符合笛卡尔树的排列就是这个树的拓扑序列个数，就是$\frac{n!}{2\prod size_i}$。然后显然每个排列期望的和是$\frac{n}{2}$，于是答案就是$\frac{n}{2\prod size_i}$。

#include <bits/stdc++.h>
using namespace std;

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
const ll MOD = 1000000007;
const int MAXN = (int)1e6 + 5;

int l[MAXN], r[MAXN], vis[MAXN], stk[MAXN], inv[MAXN], sz[MAXN], n, ans, T;
pii a[MAXN];

void dfs(int v) {
    if(l[v]) dfs(l[v]);
    if(r[v]) dfs(r[v]);
    sz[v] = 1 + sz[l[v]] + sz[r[v]];
    ans = (1LL * ans * inv[sz[v]]) % MOD;
}

int build() { //建笛卡尔树
    int top = 0;
    rep(i, 1, n + 1) l[i] = r[i] = vis[i] = 0;
    rep(i, 1, n + 1) {
        int k = top;
        while(k > 0 && a[stk[k - 1]] < a[i]) --k;
        if(k) r[stk[k-1]] = i;
        if(k<top) l[i] = stk[k];
        stk[k++] = i;
        top = k;
    }
    rep(i, 1, n + 1) vis[l[i]] = vis[r[i]] = 1;
    int ret = 0;
    rep(i, 1, n + 1) if(vis[i] == 0) ret = i;
    return ret;
}

void slove() {
    int ret = build();
    ans = 1;
    memset(sz, 0x00, sizeof(int) * (n + 1));
    dfs(ret);
    printf("%d\n", (int)(1LL * ans * n % MOD * inv[2] % MOD));
}

int main()
{
    inv[1] = 1; 
    rep(i, 2, MAXN) inv[i] = 1LL * inv[MOD%i]*(MOD-MOD/i)%MOD;
    while(scanf("%d", &T) != EOF) {
        while(T--) {
            scanf("%d", &n);
            rep(i, 1, n + 1) {
                scanf("%d", &a[i].first);
                a[i].second = -i;
            }
            slove();
        }
    }
    return 0;
}