15.5 动态规划之最优二叉树

最新推荐文章于 2024-05-07 00:14:45 发布

饭泡粥粥泡饭

最新推荐文章于 2024-05-07 00:14:45 发布

阅读量752

点赞数

分类专栏：算法导论文章标签：算法 c++ 动态规划

本文链接：https://blog.csdn.net/aha__easy/article/details/121607690

版权

最优二叉搜索树成本优化二叉树查询频率算法实现

关键词由CSDN通过智能技术生成

算法导论专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<vector>
using namespace std;

void Optimal_BST(vector<double> q,vector<double> p,int n)
{
    vector<vector<double>> e(n+2,vector<double>(n+1));
    vector<vector<double>> w(n+2,vector<double>(n+1));
    vector<vector<double>> root(n+1,vector<double>(n+1));
    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;
            e[i][j]=INT_MAX;
            w[i][j]=w[i][j-1]+p[j-1]+q[j];
            for(int r=i;r<=j;r++)
            {
                double t=e[i][r-1]+e[r+1][j]+w[i][j];
                if(t<e[i][j])
                {
                    e[i][j]=t;
                    root[i][j]=r;
                }
            }
        }
    }
    for(int i=1;i<=n+1;i++)
    {
        for(int j=i-1;j<=n;j++)
        {
            cout << "e[" << i << "," << j << "]=" << e[i][j] << "\t";
        }
        cout << endl;
    }
    cout << endl;
    for(int i=1;i<=n;i++)
    {
        for(int j=i;j<=n;j++)
        {
            cout << "root[" << i << "," << j << "]=" << root[i][j] << "\t";
        }
        cout << endl;
    }
}

int main()
{
    vector<double> p={0.04,0.06,0.08,0.02,0.10,0.12,0.14};
    vector<double> q={0.06,0.06,0.06,0.06,0.05,0.05,0.05,0.05};
    Optimal_BST(q,p,7);
    return 0;
}