最优二叉排序树

OBST

最优二叉排序树（OBST）：在BST的前提下，每个节点有被搜索的概率，然后要找到一个BST，使得带权搜索路径最小

$$K\left[1\cdots n\right]=<k_1,\cdots ,k_n>(k_1<k_2<\cdots <k_n)$$
$k_i$是BST上的节点（key）

$$D\left[0\cdots n\right]=<d_0,\cdots ,d_n>$$
其中
$k_1<d_0$
$d_n>k_n$
$k_i<d_i<k_{i+1}(i=1,2,\cdots ,n-1)$
$d_i$表示的是搜索失败的节点（虚节点）

用$p_i$表示$k_i$被搜索到的概率
$q_i$表示$d_i$被搜索到的概率

$$\sum _{i=1}^n{p}_i+\sum _{i=0}^n{q}_i=1$$
带权路径
$$E_T=\sum _{i=1}^{n}dept{h}_T(k_i)p_i+\sum _{i=0}^{n}dept{h}_T(d_i)q_i$$
其中根节点的深度为1
我们的目标就是让这个带权路径最小

令$e\left[i,j\right]$表示包含$K\left[i,j\right]$的OBST的带权路径,
$w\left[i,j\right]={\sum }_{l=i}^j{p}_l+{\sum }_{l=i-1}^j{q}_l$,
$T_i^j$表示包含$k_i$到$k_j$的树
$r\left[i,j\right]$表示$T_i^j$的OBST根节点
则
(1)$e\left[i,i-1\right]=q_{i-1}$
(2)当$i\le j$
$$\begin{array}{rl}e\left[i,j\right]& =\underset{i\le r\le j}{\min }(\sum _{l=i}^{r-1}(dept{h}_{T_i^{r-1}}(k_l)+1)p_l+\sum _{l=r+1}^j(dept{h}_{T_{r+1}^j}(k_l)+1)p_l+\\ & \sum _{l=i-1}^{r-1}(dept{h}_{T_i^{r-1}}(d_l)+1)q_l+\sum _{l=r}^j(dept{h}_{T_{r+1}^j}(d_l)+1)q_l+\\ & p_r)\\ & =\underset{i\le r\le j}{\min }(\sum _{l=i}^{r-1}dept{h}_{T_i^{r-1}}(k_l)p_l+\sum _{l=i-1}^{r-1}dept{h}_{T_i^{r-1}}(d_l)q_l+\\ & \sum _{l=r+1}^{j}dept{h}_{T_{r+1}^j}(k_l)p_l+\sum _{l=r}^{j}dept{h}_{T_{r+1}^j}(d_l)q_l+\\ & \sum _{l=i}^j{p}_l+\sum _{l=i-1}^j{q}_l)\\ & =\underset{i\le r\le j}{\min }(e\left[i,r-1\right]+e\left[r+1,j\right]+w\left[i,j\right])\end{array}$$
所以
$$e\left[i,j\right]=\{\begin{array}{ll}{q}_{i-1},& j=i-1\\ \underset{i\le r\le j}{\min }(e\left[i,r-1\right]+e\left[r+1,j\right])+w\left[i,j\right],& i\le j\end{array}$$
可以看出，如果根节点是固定的，那么左右子树都是OBST，也就是是想找到$i$到$j$的OBST，可以枚举根节点，算左右两边的OBST
于是dp方程就有了

#include <iostream>
#include <cstring>
#include <cfloat>
#include <vector>
using namespace std;
const int N = 1000;
//假设有n个key，那数组要e[n+2][n+2],w[n+2][n+2],r[n+2][n+2]
double e[N][N];
double w[N][N];
int r[N][N];

/**
 * @description: 最优二叉排序树
 * @param {double} *p 找到的key权重
 * @param {double} *q 找不到的key的权重
 * @param {int} n 找到的key的个数
 */
void build_obst(double *p, double *q, int n)
{
    // memset(e,0,sizeof(e));
    // memset(w,0,sizeof(w));
    for (int i = 1; i <= n + 1; ++i)
    {
        e[i][i - 1] = q[i - 1];
        w[i][i - 1] = q[i - 1];
    }
    for (int l = 1; l <= n; ++l)
    {
        for (int i = 1; i <= n - l + 1; ++i)
        {
            int j = i + l - 1;
            double ans = DBL_MAX;
            w[i][j] = w[i][j - 1] + p[j] + q[j];
            for(int cur_root=i;cur_root<=j;++cur_root){
                double t=e[i][cur_root-1]+e[cur_root+1][j];
                if(t<ans){
                    ans=t;
                    r[i][j]=cur_root;
                }
            }
            e[i][j]=ans+w[i][j];
        }
    }
}

int main()
{
    /**
     7
          0.04 0.06 0.08 0.02 0.10 0.12 0.14
     0.06 0.06 0.06 0.06 0.05 0.05 0.05 0.05
     */
    double p[N];
    double q[N];
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
    {
        scanf("%lf", &p[i]);
    }
    for (int i = 0; i <= n; ++i)
    {
        scanf("%lf", &q[i]);
    }
    build_obst(p, q, n);
    for (int i = 0; i <= n + 1; ++i)
    {
        for (int j = 0; j <= n + 1; ++j)
        {
            printf("%lf ", e[i][j]);
        }
        printf("\n");
    }
    printf("\n");
    for (int i = 0; i <= n + 1; ++i)
    {
        for (int j = 0; j <= n + 1; ++j)
        {
            printf("%lf ", w[i][j]);
        }
        printf("\n");
    }
    printf("\n");
    for (int i = 0; i <= n + 1; ++i)
    {
        for (int j = 0; j <= n + 1; ++j)
        {
            printf("%d ", r[i][j]);
        }
        printf("\n");
    }
    return 0;
}

时间复杂度
$$\begin{array}{rl}& \sum _{l=1}^n\sum _{i=1}^{n-l+1}\sum _{r=i}^{i+l-1}1\\ & =\sum _{l=1}^n\sum _{i=1}^{n-l+1}l\\ & =\sum _{l=1}^n(n-l+1)l\\ & =\sum _{l=1}^n((n+1)l-l^2)\\ & =\frac{(n+1)(1+n)n}{2}-\frac{n(n+1)(2n+1)}{6}\\ & =\frac{n(n+1)(n+2)}{6}\end{array}$$
所以是$\Theta (n^3)$
空间复杂度$O(n^2)$

优化

$$r[i][j-1]\le r[i][j]\le r[i+1][j]$$
证明：
再说

#include <iostream>
#include <cstring>
#include <cfloat>
#include <vector>
using namespace std;
const int N = 1000;
//假设有n个key，那数组要e[n+2][n+2],w[n+2][n+2],r[n+2][n+2]
double e[N][N];
double w[N][N];
int r[N][N];

/**
 * @description: 最优二叉排序树
 * @param {double} *p 找到的key权重
 * @param {double} *q 找不到的key的权重
 * @param {int} n 找到的key的个数
 */
void build_obst(double *p, double *q, int n)
{
    // memset(e,0,sizeof(e));
    // memset(w,0,sizeof(w));
    for (int i = 1; i <= n + 1; ++i)
    {
        e[i][i - 1] = q[i - 1];
        w[i][i - 1] = q[i - 1];
    }
    for (int l = 1; l <= n; ++l)
    {
        for (int i = 1; i <= n - l + 1; ++i)
        {
            int j = i + l - 1;
            double ans = DBL_MAX;
            w[i][j] = w[i][j - 1] + p[j] + q[j];
            // for(int cur_root=i;cur_root<=j;++cur_root){
            //     double t=e[i][cur_root-1]+e[cur_root+1][j];
            //     if(t<ans){
            //         ans=t;
            //         r[i][j]=cur_root;
            //     }
            // }
            // e[i][j]=ans+w[i][j];
            if (i < j)
            {
                for (int cur_root = r[i][j - 1]; cur_root <= r[i + 1][j]; ++cur_root)
                {
                    double t = e[i][cur_root - 1] + e[cur_root + 1][j];
                    if (t < ans)
                    {
                        ans = t;
                        r[i][j] = cur_root;
                    }
                }
                e[i][j] = ans + w[i][j];
            }
            else
            { //i==j
                e[i][j] = e[i][j - 1] + e[j + 1][j] + w[i][j];
                r[i][j] = i;
            }
        }
    }
}

int main()
{
    /**
     7
          0.04 0.06 0.08 0.02 0.10 0.12 0.14
     0.06 0.06 0.06 0.06 0.05 0.05 0.05 0.05
     */
    double p[N];
    double q[N];
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
    {
        scanf("%lf", &p[i]);
    }
    for (int i = 0; i <= n; ++i)
    {
        scanf("%lf", &q[i]);
    }
    build_obst(p, q, n);
    for (int i = 0; i <= n + 1; ++i)
    {
        for (int j = 0; j <= n + 1; ++j)
        {
            printf("%lf ", e[i][j]);
        }
        printf("\n");
    }
    printf("\n");
    for (int i = 0; i <= n + 1; ++i)
    {
        for (int j = 0; j <= n + 1; ++j)
        {
            printf("%lf ", w[i][j]);
        }
        printf("\n");
    }
    printf("\n");
    for (int i = 0; i <= n + 1; ++i)
    {
        for (int j = 0; j <= n + 1; ++j)
        {
            printf("%d ", r[i][j]);
        }
        printf("\n");
    }
    return 0;
}

时间复杂度
$$\begin{array}{rl}T& =\sum _{l=2}^n\sum _{i=1}^{n-l+1}\sum _{k=r[i][j-1]}^{r[i+1][j]}1+\sum _{l=1}^1\sum _{i=1}^{n-l+1}1\\ & =n+\sum _{l=2}^n\sum _{i=1}^{n-l+1}(r[i+1][j]-r[i][j-1]+1)\\ & =n+\sum _{l=2}^n(n-l+1)+\sum _{l=2}^n\sum _{i=1}^{n-l+1}(r[i+1][j]-r[i][j-1])\\ & =n+(n+1)(n-1)-\frac{(n-1)(2+n)}{2}+\sum _{l=2}^n\sum _{i=1}^{n-l+1}(r[i+1][j]-r[i][j-1])\\ & =\frac{n(n+1)}{2}+\sum _{l=2}^n\sum _{i=1}^{n-l+1}(r[i+1][j]-r[i][j-1])\end{array}$$
考察${\sum }_{i=1}^{n-l+1}(r[i+1][j]-r[i][j-1])$的每一项
$$\begin{gathered} r[2][l]-r[1][l-1]+ \\ r[3][l+1]-r[2][l]+ \\ r[4][l+2]-r[3][l+1]+ \\ ⋮ \\ r[n-l+2][n]-r[n-l+1][n-1] \end{gathered}$$
所以${\sum }_{i=1}^{n-l+1}(r[i+1][j]-r[i][j-1])=r[n-l+2][n]-r[1][l-1]$
所以
$$T=\frac{n(n+1)}{2}+\sum _{l=2}^n(r[n-l+2][n]-r[1][l-1])$$
显然
$$T\le \frac{n(n+1)}{2}+\sum _{l=2}^n(n-1)=\frac{3n^2-3n+2}{2}$$
根据$r[i][j-1]\le r[i][j]\le r[i+1][j]$
有$r[i+1][j]-r[i][j-1]\ge 0$
$$T=\frac{n(n+1)}{2}+\sum _{l=2}^n\sum _{i=1}^{n-l+1}(r[i+1][j]-r[i][j-1])\ge \frac{n(n+1)}{2}+0$$
所以时间复杂度$\Theta (n^2)$
空间复杂度$O(n^2)$

参考

https://zhuanlan.zhihu.com/p/152636524