Computers

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 maintenanc e cost. Of course, you must pay a fixed cost 
for each new computer you get.  
 
Suppose you are considering a 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. 
 

Output

White spaces can occur freely in the input. The input data are correct and terminate with 
an end of file. For each set of data the program prints the result to the standard output from the 
beginning of a line. An input/output sample is in the table below. 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 .  
 
 The result for the data set is the minimum cost 19. 
 

Sample Input

3

3

5 7 50

6 8

10

Sample Output

19

题意：用n年电脑问题，第一年用c元买电脑（这一年有维修费m（1，1）），第二年有两种选择

1）不买电脑，用第一年买的，但维修费高，第一第二年维修费为m（1,2）；

2）新买电脑，花费c，并支付本年维修费m（2,2）。

。。。如此，用完n年，求最小消费额。

分析：如题，可模拟此过程-->

5 7 50

6 8

10

可变换为，每年需要花费的金额-->

5 2 43

6 2

10

模拟过程：由第一年推至第n年

第一年--》

5 2 43

6 2

  10

第二年--》

5 7 43

（5+3+6） 2

10

第三年--》

5 7 50

14 14+2

min（14,7）+3+10

可知最小消费为16+3=19

。。。模拟题！

代码：

#include <iostream>
#include <stdio.h>
using namespace std;
int num[1001][1001];
int main()
{
    int c,n,i,j,k,min,temp;
	while(scanf("%d",&c)!=EOF)
	{
		scanf("%d",&n);
		for(i=1;i<=n;i++)
		{
			temp=0;
			for(j=i;j<=n;j++)
			{
				scanf("%d",&num[i][j]);
				if(j>i) num[i][j]-=temp;
				temp+=num[i][j];
			}
		}
		for(i=2;i<=n;i++)
		{
			min=1000000;
			for(j=1;j<=i;j++)
			{
				if(j==i)
				{
					for(k=1;k<=j-1;k++)
						if(min>num[k][i-1])
							min=num[k][i-1];
					num[i][j]+=min+c;
					continue;
				}
				num[j][i]+=num[j][i-1];
			}
		}
		min=1000000;
		for(i=1;i<=n;i++)
			if(num[i][n]<min)
				min=num[i][n];
		printf("%d\n",min+c);
	}
    return 0;    
}