投资分配

//最优策略应该是2,0,3,1，现在 只会求最大效益 
#include <iostream>
#include <cstring>
#include <cstdlib>
using namespace std;
int ans[5];//保存最优策略 ,一维向量 
int g[5][8] = {//投资0到6w时，各个工厂获得的效益 
                {0,20,50,65,80,85,85},
                {0,20,40,50,55,60,65},
                {0,25,60,85,100,110,115},
                {0,25,40,50,60,65,70}
            };
int f[5][7];
int main()
{
    int i,j,k,t,T;
    memset(f,0,sizeof(f));
    memset(ans,0,sizeof(ans));
    t = 0;
    int next ;
    for(k=1;k<=4;k++)
    {
        int Max = 0;
        for(i=0;i<=6;i++)
        {
            for(j=0;j<=i;j++)
            {
                if(Max<(g[k-1][j]+f[k-1][i-j]))//因为g数组中行标从 0开始，所以g的下标也是k-1不是k 
                {
                    next = j;
                    Max = g[k-1][j]+f[k-1][i-j];
                }
            }  
            f[k][i] = Max;
            ans[t++] = next;
        }
    }         
    cout<<"最大利润"<<f[4][6]<<endl;
    cout<<"最优策略 :";
    for(i=0;i<3;i++)
        cout<<ans[i]<<",";
    cout<<ans[3]<<endl;
    system("pause");
}