lightoj 1047 - Neighbor House DP（简单线性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

题意：

有n个房子，每个房子都可以染红绿蓝三种颜色，并且给出了每个房子染每种颜色费用，相邻房子不能同色，求染完房子的最小费用。

思路：dp[i][j] 表示第i个房子染j颜色所用的最小费用，因为要求相邻的两个不能相同，每个房子的来源就是前面房子的涂不同颜色的两个房子+这个房子要涂的颜色的费用，每个房子三种颜色都尝试下，只有三种颜色。经典的线性DP

代码：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn = 25;
int r[maxn], g[maxn], b[maxn], dp[maxn][3];
int main()
{
    int t, n, ca =  1;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        for(int i = 1; i <= n; i++)
            scanf("%d%d%d", &r[i], &g[i], &b[i]);
        memset(dp, 0, sizeof(dp));
        for(int i = 1; i <= n; i++)
        {
            dp[i][0] = min(dp[i-1][1], dp[i-1][2]) + r[i];
            dp[i][1] = min(dp[i-1][0], dp[i-1][2]) + g[i];
            dp[i][2] = min(dp[i-1][0], dp[i-1][1]) + b[i];
        }
        printf("Case %d: %d\n",ca++, min(min(dp[n][0], dp[n][1]), dp[n][2]));
    }
    return 0;
}