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

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;

const int inf = 1e9;
int dp[30][3];
int hourse[30][3];
int T,n,r,g,b;



int main(){
    
    
    scanf("%d",&T);
    for(int t=1;t<=T;t++){
        memset(dp,0,sizeof(dp));
        scanf("%d",&n);
        for(int i=0;i<n;i++) scanf("%d%d%d",&hourse[i][0],&hourse[i][1],&hourse[i][2]);
        
        for(int i=n-1;i>=0;i--){
            
            dp[i][0] = min(dp[i+1][1],dp[i+1][2]) + hourse[i][0];
            dp[i][1] = min(dp[i+1][0],dp[i+1][2]) + hourse[i][1];
            dp[i][2] = min(dp[i+1][0],dp[i+1][1]) + hourse[i][2];
            
        }                
        printf("Case %d: %d\n",t,min(dp[0][0],min(dp[0][1],dp[0][2])));
    }
    
    return 0;
}

View Code

lightoj-1047 - Neighbor House(简单的线性dp)

原文：http://www.cnblogs.com/yuanshixingdan/p/5540831.html