light oj 1047 - Neighbor House 动态规划

题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87730#problem/C

题目：

Description

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 Bare 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

2

4

13 23 12

77 36 64

44 89 76

31 78 45

3

26 40 83

49 60 57

13 89 99

Sample Output

Case 1: 137

Case 2: 96

Hint

Use simple DP

题意：

有n户人，打算把他们的房子图上颜色，有red、green、blue三种颜色，每家人涂不同的

颜色要花不同的费用，而且相邻两户人家之间的颜色要不同，求最小的总花费费用。

分析：

这个跟数字三角形问题很像，这个是求最小的值，而且有些限制，每次走到点要和上次走的点不在同一列。

动态转移方程：

dp[i][j]=a[i][j]+min(dp[i+1][j-1],dp[i+1][j+1])

 #include<iostream>
 #include<cstring>
 using namespace std;
 int a[][];
 int dp[][];
 int min(int a,int b)
 {
   if(a<b)  return a;
   else  return b;
 }
 int main()
 {
     int t,n,i,c=,j;
     cin>>t;
     while(t--)
     {
         c++;
      cin>>n;
      memset(dp,,sizeof(dp));
      for(i=;i<=n;i++)
          for(j=;j<=;j++)
              cin>>a[i][j];
          for(i=;i<=;i++)    dp[n][i]=a[n][i];
          for(i=n-;i>=;i--)
             for(j=;j<=;j++)
             {
         if(j==)
             dp[i][j]=a[i][j]+min(dp[i+][],dp[i+][]);                  //不能与上一步相同
         if(j==)
            dp[i][j]=a[i][j]+min(dp[i+][],dp[i+][]);
         if(j==)
             dp[i][j]=a[i][j]+min(dp[i+][],dp[i+][]);
             }
             if(dp[][]<dp[][])                                               //比较出最大值
                 dp[][]=dp[][];
               if(dp[][]<dp[][])
                   dp[][]=dp[][];
         cout<<"Case "<<c<<": "<<dp[][]<<endl;
     }
 return ;
 }