Light OJ 1047 Neighbor House(简单DP)

:

[code]#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;
typedef long long LL;

int n,dp[50][3],a[50][3];

int main(){
int i,j,k,cas,T;
scanf("%d",&cas);
for(T = 1;T <= cas;T++){
scanf("%d",&n);
for(i = 1;i <= n;i++)
for(j = 0;j < 3;j++) scanf("%d",&a[i][j]);
memset(dp,63,sizeof(dp));
for(j = 0;j < 3;j++) dp[1][j] = a[1][j];
for(i = 2;i <= n;i++){
for(j = 0;j < 3;j++){
for(k = (j+1)%3;k != j;k = (k+1)%3){
dp[i][j] = min(dp[i][j],dp[i-1][k]+a[i][j]);
}
}
}
printf("Case %d: %d\n",T,*min_element(dp
,dp
+3));
}
return 0;
}