hdu Employment Planning（dp 通过DFS写DP）

题意很简单：

先用DFS写出来， TL了……

#include<iostream>
using namespace std;
int month;
int hcost, sala, fcost;
int total, ans;
int num[13];
int minnum, maxnum;
void DFS(int h, int th)
{
	if(th > month)
	{
        if(ans>total)ans = total;
		return;
	}

    if( total >= ans ) return;
	for(int i=num[th]; i<=maxnum; i++)
	{
		if( i<=h )
		{
			total= total+(h-i)*fcost+i*sala;
			DFS(i, th+1);
           	total= total-(h-i)*fcost-i*sala;
		}
		else
		{
			total= total+(i-h)*hcost+i*sala;
			DFS(i, th+1);
           	total= total-(i-h)*hcost-i*sala;
		}

	}
   //  cout<<1<<endl;
}
int main()
{
   while( cin>>month &&month)
   {
	   total = 0;
	   minnum = ans = 99999999;
	   maxnum = 0;

	   cin>>hcost>>sala>>fcost;
       for(int i=1; i<=month; i++)
	   {
		   cin>>num[i];
           if(num[i]>maxnum) maxnum = num[i];
		   if(num[i]<minnum) minnum = num[i];
	   }

	   DFS(0, 1);

	   cout<<ans<<endl;
   }
}

通过DFS写出这道题目的状态表示， 然后在想出状态转移方程

#include<iostream>
using namespace std;
#define MAX 999999999
int main()
{
    int dp[13][10001];
    int n;
    int hcost, sala, fcost;
    int ans, maxnum;
    int num[13];
     while( cin>>n &&n)
    {
	   maxnum = 0;

	   cin>>hcost>>sala>>fcost;
       for(int i=0; i<n; i++)
	   {
		   cin>>num[i];
           if(num[i]>maxnum) maxnum = num[i];
	   }


      for(int j=num[0];  j<=maxnum; j++)
         dp[0][j] = j*(hcost+sala);
      for(int i=1; i<n; i++)
      {
         for(int j=num[i]; j<=maxnum; j++)
         {
             dp[i][j] =  MAX;
             for(int k=num[i-1]; k<=maxnum; k++)
             {
                 if( k<j) dp[i][j]=min(dp[i][j], dp[i-1][k]+(j-k)*hcost+j*sala);
                 else dp[i][j]=min(dp[i][j], dp[i-1][k]+(k-j)*fcost+j*sala);
             }
         }
      }

      ans = MAX;
      for(int i=num[n-1]; i<=maxnum; i++)
         ans = min(ans, dp[n-1][i]);
         
	   cout<<ans<<endl;
    }

}