题意: 一个胖子要在跳舞机跳舞,有上下左右4个键,每次移动都需要消耗体力(停着不动也需要消耗1点),问这个胖子最小要消耗多少体力能够完成给定的方向串。
解法: 设dp[i][j][k]为左脚在i,右脚在j,第k个字符时的最小体力,step为现在要踩的方向,有如下状态转移:
dp[i][step][k] = min(dp[i][j][k-1] + count(step,j))
dp[step][j][k] = min(dp[i][j][k-1] + count(step,i))
注意两只脚不能同时在一格的限制条件。
/* **********************************************
Author : Nero
Created Time: 2013-8-26 16:56:20
Problem id : LA 2031
Problem Name: Dance Dance Revolution
*********************************************** */
/*
本质水题一道。没有判4和1的相邻,导致WA了一个半小时。
*/
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
#define REP(i,a,b) for(int i=(a); i<(int)(b); i++)
#define clr(a,b) memset(a,b,sizeof(a))
const int INF = ~0u>>1;
int dp[5][5][100000];
int count(int a, int b) {
if(a == b) return 1;
if(a == 0) return 2;
if(abs(a-b) == 1 || a == 4 && b == 1 || a == 1 && b == 4) return 3;
return 4;
}
int main() {
int now;
int step;
while(~scanf("%d", &step), step) {
REP(i,0,5) REP(j,0,5) REP(k,0,100000) dp[i][j][k] = INF;
dp[0][0][0] = 0;
now = 0;
do {
REP(i,0,5) {
REP(j,0,5) if(dp[i][j][now] != INF) {
if(i != step) dp[i][step][now+1] = min(dp[i][step][now+1], dp[i][j][now] + count(j,step));
if(j != step) dp[step][j][now+1] = min(dp[step][j][now+1], dp[i][j][now] + count(i,step));
}
}
now ++;
}while(~scanf("%d", &step), step);
int minx = INF;
REP(i,0,5) REP(j,0,5) minx = min(minx, dp[i][j][now]);
printf("%d\n", minx);
}
return 0;
}