HDU 1913 Computers (解题报告)

Problem Description

Everybody is fond of computers, but buying a new one is always a money challenge. Fortunately, there is always a convenient way to deal with. You can replace your computer and get a brand new one, thus saving some maintenance cost. Of course, you must pay a fixed cost for each new computer you get.

Suppose you are considering an n year period over which you want to have a computer. Suppose you buy a new computer in year y, 1<=y<=n Then you have to pay a fixed cost c, in the year y, and a maintenance cost m(y,z) each year you own that computer, starting from year y through the year z, z<=n, when you plan to buy - eventually - another computer.

Write a program that computes the minimum cost of having a computer over the n year period.

 

 

Input

The program input is from a text file. Each data set in the file stands for a particular set of costs. A data set starts with the cost c for getting a new computer. Follows the number n of years, and the maintenance costs m(y,z), y=1..n, z=y..n. The program prints the minimum cost of having a computer throughout the n year period.

White spaces can occur freely in the input. The input data are correct and terminate with an end of file.

 

 

Output

For each set of data the program prints the result to the standard output from the beginning of a line.

 

 

Sample Input

3
3
5 7 50
6 8
10

 

 

Sample Output

19


  
  

   
   

    
    Hint
   
   

An input/output sample is shown above. There is a single data set. The cost for getting a new computer is c=3. The time period n is n=3 years, and the maintenance costs are:

For the first computer, which is certainly bought: m(1,1)=5, m(1,2)=7, m(1,3)=50,
For the second computer, in the event the current computer is replaced: m(2,2)=6, m(2,3)=8,
For the third computer, in the event the current computer is replaced: m(3,3)=10.

  
  

分析: 如输入样例:第一个数字表示买一台电脑的固定成本c，第二个数字表示n年，接下来n行每一行的个数逐渐减少。

运用动态规划的思想，首先求出第一行每种情况的总消费，接下来的每一行存在这种关系：（假设这些数据存在sum[1000][1000]这个数组里）

sum[i][j]=sum[i-1][i-1]+c+sum[i][j]这个结果和sum[i-1][j]比较，将小的那个存在sum[i][j]里。依次递推，直到求出sum[n-1][n-1];

代码如下：

 #include <stdio.h>
#define N 1000
int sum[N][N];
int main()
{
	int c,n,i,j;
	while (scanf("%d",&c)!=EOF)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			for(j=i;j<n;j++)
				scanf("%d",&sum[i][j]);
		}
		for(i=0;i<n;i++)
		{
			for(j=i;j<n;j++)
			{
				if(i==0)
					sum[i][j]=c+sum[i][j];
				else
					sum[i][j]=(sum[i-1][i-1]+c+sum[i][j])<(sum[i-1][j])?(sum[i-1][i-1]+c+sum[i][j]):(sum[i-1][j]);
			}
		}
		printf("%d/n",sum[n-1][n-1]);
	}
	return 0;
}