Paint House

题目：
There are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost of painting each house with a certain color is different. You have to paint all the houses such that no two adjacent houses have the same color.

The cost of painting each house with a certain color is represented by a n x 3 cost matrix. For example, costs[0][0] is the cost of painting house 0 with color red; costs[1][2] is the cost of painting house 1 with color green, and so on… Find the minimum cost to paint all houses.

Note:
All costs are positive integers.
题解：
1、确定状态。dp[i][j]表示到达第i栋房子颜色是j的最少费用。
对于最后一步dp[n][j]应该等于min(dp[i-1][k]+cost[i][j]),k!=j，并且所有的子问题都是这样。
2、确定状态转移方程。
由上面的推算可以得出方程
3、边界情况和起始条件。
此题需要将dp的初值都设置为inf。
4、计算顺序，此题是从前往后运算。

#include<bits/stdc++.h>
using namespace std;
const int inf = 0x7f7f7f7f;
const int N = 1e5;


inline int read() {
    char ch=getchar();int x=0,f=1;
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while('0'<=ch&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x * f;
}


int dp[N][4];
int cost[N][4];


int main(){
    int n = read();
    for(int i = 1;i <= n;i++){
        cost[i][1] = read();
        cost[i][2] = read();
        cost[i][3] = read();
        dp[i][1] = dp[i][2] = dp[i][3] = inf;
    }

    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= 3;j++){
            for(int k = 1;k <= 3;k++){
                if(j == k) continue;
                dp[i][j] = min(dp[i][j],dp[i-1][k]+cost[i][j]);
            }
        }
    }
    cout<<min(dp[n][1],min(dp[n][2],dp[n][3]))<<endl;
    return 0;
}