【加分二叉树】

Kent_J_Truman

已于 2024-08-26 12:08:32 修改

阅读量341

点赞数 10

分类专栏： dp 算法文章标签：算法 c++

于 2024-08-26 12:03:47 首次发布

本文链接：https://blog.csdn.net/m0_73669127/article/details/141560374

版权

算法同时被 2 个专栏收录

123 篇文章 0 订阅

订阅专栏

18 篇文章 0 订阅

订阅专栏

题目

代码

#include <bits/stdc++.h>
using namespace std;
const int N = 30;
int a[N];
int f[N][N], root[N][N];
int n;
void Print(int i, int j)
{
    if(i == j)
    {
        cout << i << " ";
        return;
    }
    if(i > j) return;
    
    int k = root[i][j];
    
    cout << k << " ";
    Print(i, k-1);
    Print(k+1, j);
}
int main()
{
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i], f[i][i] = a[i];
    
    for(int len = 2; len <= n; len++)
    {
        for(int i = 1, j; (j = i + len - 1) <= n; i++)
        {
            for(int k = i; k <= j; k++)
            {
                if(k == i)
                {
                    if(f[i][j] < a[k] + f[k+1][j])
                        f[i][j] = a[k] + f[k+1][j], root[i][j] = k;
                }
                else if(k == j)
                {
                    if(f[i][j] < a[k] + f[i][k-1])
                    f[i][j] = a[k] + f[i][k-1], root[i][j] = k;
                }
                else
                {
                    if(f[i][j] < f[i][k-1] * f[k+1][j] + a[k])
                    f[i][j] = f[i][k-1] * f[k+1][j] + a[k], root[i][j] = k;
                }
            }
        }
    }
    
    cout << f[1][n] << endl;
    Print(1, n);
    return 0;
}