【light-oj】-1047 - Neighbor House（dp）

1047 - Neighbor House

PDF (English)

Statistics

Forum

Time Limit: 0.5 second(s)

Memory Limit: 32 MB

The people of Mohammadpur have decided to paint each of their houses red, green, or blue. They've also decided that no two neighboring houses will be painted the same color. The neighbors of house i are houses i-1 and i+1. The first and last houses are not neighbors.

You will be given the information of houses. Each house will contain three integers "R G B" (quotes for clarity only), where R, G and B are the costs of painting the corresponding house red, green, and blue, respectively. Return the minimal total cost required to perform the work.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case begins with a blank line and an integer n (1 ≤ n ≤ 20) denoting the number of houses. Each of the next n lines will contain 3 integers "R G B". These integers will lie in the range [1, 1000].

Output

For each case of input you have to print the case number and the minimal cost.

Sample Input	Output for Sample Input
2   4 13 23 12 77 36 64 44 89 76 31 78 45   3 26 40 83 49 60 57 13 89 99	Case 1: 137 Case 2: 96

题意：相邻的房子不可以涂相同的颜色，求最少花费

题解：不可以每次取最少，因为上面对下面选择有影响

AC代码：

#include<cstdio>   
#include<cstring>
#include<algorithm>
using namespace std;
int main()  
{  
    int u,ca=1;
    scanf("%d",&u);
    while(u--)
    {
    	int n;
    	scanf("%d",&n);
    	int a[22][5];
		int dp[22][5];
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=3;j++)
				scanf("%d",&a[i][j]);
		}
		dp[1][1]=a[1][1];
		dp[1][2]=a[1][2];
		dp[1][3]=a[1][3];
		for(int i=2;i<=n;i++)
		{
			dp[i][1]=min(dp[i-1][2],dp[i-1][3])+a[i][1];
			dp[i][2]=min(dp[i-1][1],dp[i-1][3])+a[i][2];
			dp[i][3]=min(dp[i-1][1],dp[i-1][2])+a[i][3];
		}
		printf("Case %d: %d\n",ca++,min(dp[n][1],min(dp[n][2],dp[n][3])));
	}
    return 0;  
}