最优二叉搜索树

#include <iostream>
using namespace std;
#define MAX 65536
#define LENGTH 64
float w[5][5]={0};
float c[5][5]={0};
int r[5][5]={0};
int osbtree[LENGTH]={0};
int index;
void OBST(float p[],float q[],int n){
	int i,j,k;
	float min;
	for(i=0;i<=n-1;++i){
		w[i][i]=q[i];
		r[i][i]=0;
		c[i][i]=0;
		w[i][i+1]=w[i][i]+p[i+1]+q[i+1];
		r[i][i+1]=i+1;
		c[i][i+1]=w[i][i+1];
	}
	w[n][n]=q[n];
	r[n][n]=0;
	c[n][n]=0;
	for (int m=2;m<=n;++m)
	for (i=0;i<=n-m;++i){
		min=MAX;
		j=i+m;
		w[i][j]=w[i][j-1]+p[j]+q[j];
		for (int l=i+1;l<=j;++l){
			if( (c[i][l-1]+c[l][j])<min){
				min=(c[i][l-1]+c[l][j]);
				k=l;
			}
		}
		c[i][j]=w[i][j]+c[i][k-1]+c[k][j];
		r[i][j]=k;
	}
}
void PrintTree(int i, int j){
	if(i>=j) 
	return;
	osbtree[index++]=r[i][j];
	osbtree[index++]='/';
	
	PrintTree(i,r[i][j]-1);
	osbtree[index++]='\\';
	PrintTree(r[i][j],j);
		
	
}
int main(){
	char string[5][6]={"","a1","a2","a3","a4"};
	float p[5]={0,4,2,1,1};
	float q[5]={2,3,1,1,1};
	OBST(p,q,4);
 
	PrintTree(0,4);
 /*
	for (int i=0;i<5;++i){
		for (int j=0;j<5;++j)
		cout<<w[j][j+i]<<","<<c[j][j+i]<<","<<r[j][j+i]<<"\t";
		cout<<endl;
	}
	*/
	cout<<"\t"<<string[osbtree[0]]<<endl;
	for (int i=1;i<index;++i){
		if (osbtree[i]=='/' || osbtree[i]=='\\')
		continue;
		else if (osbtree[i-1]=='/')
		cout<<string[osbtree[i]];
		else if(osbtree[i-1]=='\\')
		cout<<"\t\t"<<string[osbtree[i]]<<endl;
	}
	return 0;
}