红黑树的红色内结点问题

#include "iostream"
#include "cmath"
#include "fstream"
#include "algorithm"
using namespace std;

/*
red(i, j, 0)表示结点数为i，黑高度为j，红色根结点的红黑树中红色结点最大值
red(i, j, 1)表示结点数为i，黑高度为j，黑色根结点的红黑树中红色结点最大值
r1 = max{ red(k,j-1,1)+red(i-k-1,j-1,1) }
r2 = max{ red(k,j,0)+red(i-k-1,j,0) }
r3 = max{ red(k,j-1,1)+red(i-k-1,j,0) }
r4 = max{ red(k,j,0)+red(i-k-1,j-1,1) }
0 <=k <= i/2
red(i,j,k) = r1+1            k=0
           =max{r1, r2, r3, r4}  k=1
红结点最小值计算类似
*/

const int MAX = 5000;  //最大结点数
const int LOG = 23;    //最大黑高度

int red[MAX+1][LOG+1][2];

//计算以2为底的对数
int ilog(int x)
{
    int i = (int)(log(x)/log(2.0));
    return i;
}

//计算非负数的和
int isum(int x, int y)
{
    if(x<0 || y<0)
        return -1;
    return x + y;
}

void init()
{
    //初始化
    memset(red, -1, sizeof(red));
    red[0][0][0] = 0;
    red[0][0][1] = 0;
    red[1][1][0] = 1;
    red[1][1][1] = 0;
    red[2][1][1] = 1;
    red[3][1][1] = 2;
    red[3][2][0] = 1;
    red[3][2][1] = 0;
}

//计算含有n个结点的红黑树中，计算红色内结点个数最大值max
void dynaMax(int n)
{
    int i, j, k, jj;
    init();
    for(i=4; i<=n; i++) //总结点个数
    {
        for(j=ilog(i+1)/2, jj=4*j; j<=jj; j++)  //黑高度范围
        {
            int imax = -1;
            for(k=0; k<=i/2; k++) //red(i,j,0) = r1+1  
            {
                int temp = isum(red[k][j-1][1], red[i-k-1][j-1][1]);
                if(imax < temp)
                    imax = temp;
            }
            if(imax >= 0)
                red[i][j][0] = imax + 1;
            imax = -1;
            for(k=0; k<=i/2; k++) //red(i,j,1) = max{r1, r2, r3, r4}
            {
                int temp = isum(red[k][j][0], red[i-k-1][j][0]);
                if(imax < temp)
                    imax = temp;
                temp = isum(red[k][j][0], red[i-k-1][j-1][1]);
                if(imax < temp)
                    imax = temp;
                temp = isum(red[k][j-1][1], red[i-k-1][j][0]);
                if(imax < temp)
                    imax = temp;
                temp = isum(red[k][j-1][1], red[i-k-1][j-1][1]);
                if(imax < temp)
                    imax = temp;
            }
            if(imax >= 0)
                red[i][j][1] = imax;  
        }

    }
}

//计算含有n个结点的红黑树中，计算红色内结点个数最小值min
void dynaMin(int n)
{
    int i, j, k, jj;
    init();
    for(i=4; i<=n; i++) //总结点个数
        for(j=ilog(i+1)/2, jj=4*j; j<=jj; j++)  //黑高度范围
        {
            int imin = i+1;
            for(k=0; k<=i/2; k++)  //red(i,j,0) = r1+1 
            {
                int temp = isum(red[k][j-1][1], red[i-k-1][j-1][1]);
                if(temp>=0 && imin > temp)
                    imin = temp;
            }
            if(imin < i+1)
                red[i][j][0] = imin + 1;
            imin = i+1;
            for(k=0; k<=i/2; k++) //red(i,j,1) = min{r1, r2, r3, r4}
            {
                int temp = isum(red[k][j][0], red[i-k-1][j][0]);
                if(temp>=0 && imin > temp)
                    imin = temp;
                temp = isum(red[k][j][0], red[i-k-1][j-1][1]);
                if(temp>=0 && imin > temp)
                    imin = temp;
                temp = isum(red[k][j-1][1], red[i-k-1][j][0]);
                if(temp>=0 && imin > temp)
                    imin = temp;
                temp = isum(red[k][j-1][1], red[i-k-1][j-1][1]);
                if(temp>=0 && imin > temp)
                    imin = temp;
            }
            if(imin < i+1)
                red[i][j][1] = imin;
        }
}

//计算整体最小值
int rmin(int i)
{
    int j, jj, imin = i + 1;
    for(j=ilog(i+3)/2, jj=4*j; j<=jj; j++)
    {
        if(red[i][j][0]>=0 && imin>red[i][j][0])
            imin = red[i][j][0];
        if(red[i][j][1]>=0 && imin>red[i][j][1])
            imin = red[i][j][1];
    }
    return imin;
}

//计算整体最大值
int rmax(int i)
{
    int j, jj, imax = -1;
    for(j=ilog(i+3)/2, jj=4*j; j<=jj; j++)
    {
        if(imax<red[i][j][0])
            imax = red[i][j][0];
        if(imax<red[i][j][1])
            imax = red[i][j][1];
    }
    return imax;
}


//执行动态规划算法
void dyna(int n, int &min, int &max)  
{
    dynaMin(n);
    min = rmin(n);
    dynaMax(n);
    max = rmax(n);
}

int main()
{
    ifstream fin("tree.txt");
    int n;
    cout << "输入结点个数：";
    fin >> n; cout << n;

    int min, max;
    dyna(n, min, max);

    cout <<"\n红色内结点个数最小值为：" << min;
    cout <<"\n红色内结点个数最大值为：" << max;
    cout << endl;
    fin.close();
    return 0;
}