《算法设计与分析》第章 动态规划法.pptVIP

void CreateOBST(float* p, float* q, float **c, int **r, float**w,int n) { //初始化，主对角线，次主对角线 for (int i=0;i=n-1;i++) { w[i][i]=q[i];c[i][i]=0.0;r[i][i]=0; w[i][i+1]=q[i]+q[i+1]+p[i+1]; c[i][i+1]=q[i]+q[i+1]+p[i+1]; r[i][i+1]=i+1; } w[n][n]=q[n];c[n][n]=0.0;r[n][n]=0; for (int m=2;m=n;m++) for (i=0;i=n-m;i++) { int j=i+m; w[i][j]=w[i][j-1]+p[j]+q[j]; int k = Find(i,j,r,c); c[i][j] = w[i][j] + c[i][k-1] + c[k][j];