1047 - Neighbor House（简单线性DP）

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef long long LL;
const int INF = 1e9+7;
const int MAXN = 155;
int dp[MAXN][3];///dp[第n个房子][房子的颜色]
int R[MAXN], G[MAXN], B[MAXN];
int main()
{
int T, cas = 1, n;
scanf("%d", &T);
while(T --)
{
memset(dp, 0, sizeof(dp));
scanf("%d", &n);

for(int i=1; i<=n; i++)
scanf("%d %d %d", &R[i], &G[i], &B[i]);

for(int i=1; i<=n; i++)
for(int j=0; j<3; j++)
{
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];
}
int ans = min(min(dp
[0], dp
[1]),dp
[2]);
printf("Case %d: %d\n",cas ++, ans );
}

return 0;
}