C++找最小成本二分检索树OBST

余祥宣, 崔国华, 邹海明. 计算机算法基础.3版[M]. 华中科技大学出版社, 2006.
P136 算法6.5
程序的输入是一个名字为input.txt的文件，保存时注意编码格式再VS上运行的话要保存为ANSI编码，如果需要的话我可以上传一份
4
P[1:4]=1 4 2 1
Q[1:5]=4 2 4 1 1

4
1 4 2 1
4 2 4 1 1

4
P[1:4]=3 3 1 1
Q[1:5]=2 3 1 1 1

4
3 3 1 1
2 3 1 1 1

#include<iostream>
#include<iomanip> 
#include<fstream>
using namespace std;
#define MAX 5

void Knuth(int &k, int i, int j, int W[][MAX], int R[][MAX], int C[][MAX])
{
    int min = C[i][j - 1] + C[j][j] + W[i][j];
    k = j ;
    for (int l = j - 1; l > i; l--)
    {  
        if (C[i][l - 1] + C[l][j] + W[i][j] < min)
        {
            min = C[i][l - 1] + C[l][j] + W[i][j];
            k = l;
        }
    }
}
void Show(int n, int W[][MAX], int R[][MAX], int C[][MAX])
{
    for (int i = 0; i <= n; i++)
    {
        for (int j = 0; j <= n - i; j++)
        {
            cout <<"(" << W[j][j + i] << "," << C[j][j + i] << "," <<R[j][j + i] << ")";
        }
        cout << endl;
    }
}
void OBST(int P[],int Q[],int n)
{
    int W[MAX][MAX];
    int R[MAX][MAX];
    int C[MAX][MAX];

    int j , k = 0;

    for (int i = 0; i <= n - 1; i++)
    {
        W[i][i] = Q[i];
        R[i][i] = 0;
        C[i][i] = 0;

        W[i][i + 1] = Q[i] + Q[i + 1] + P[i + 1];
        R[i][i + 1] = i+1;
        C[i][i + 1] = Q[i] + Q[i + 1] + P[i + 1];
    }
    W[n][n] = Q[n];
    R[n][n] = 0;
    C[n][n] = 0;

    for (int m = 2; m <= n; m++)
    {
        for (int i = 0; i <= n - m; i++)
        {
            j = i + m;
            W[i][j] = W[i][j - 1] + P[j] + Q[j];
            Knuth(k, i, j, W, R, C);
            C[i][j] = W[i][j] + C[i][k - 1] + C[k][j];
            R[i][j] = k;
        }
    }

    Show(n, W, R, C);
}

int main()
{
    int P[MAX];
    int Q[MAX];
    int n=0;

    ifstream in("input.txt");
    in >> n;
    for (int i = 1; i <= n; i++)
    {
        in >> P[i];
    }
    for (int i = 0; i <= n; i++)
    {
        in >> Q[i];
    }
    OBST(P, Q, n);

    system("pause");
    return 0;
}

运行结果