【UVALive 2031 Dance Dance Revolution】 Dp

UVALive 2031
题目的意思是一个人要跳舞
有1 2 3 4 四个方向代表上 左 下 右
那么规则就是如果从中间到四个方向 那么就是 代价 2
如果从已有的方向到相邻的方向 是代价3
如果从已有的方向到对面的方向 是代价4
如果是在原地 那么代价为1
问你完成这些动作的最小代价
我们定义 dp[k][i][j]代表到第k个舞步 左脚在 i 状态 右脚在 j 状态
首先看答案 就是 枚举最后一步是左脚还是右脚 并且相对的脚在别的状态的最小代价
那么初始化也知道 dp[0][0][0] 是 0
否则就是inf
问题是如何转移呢？
我们知道 dp[k][arr[k][j] = min(dp[k][arr[k][j],dp[k-1][i][j]+i去arr[k]的代价)
dp[k][i][arr[k] = min(dp[k][i][arr[k],dp[k-1][i][j]+j去arr[k]的代价)
只要这样转移就可以了

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 10025;
int dp[MAX_N][5][5],a[5],arr[MAX_N];
int mov(int x,int y)
{
    if(x>y) swap(x,y);
    if(x==y) return 1;
    else if(x==0) return 2;
    else if(y-x==2) return 4;
    else return 3;
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n = 1,ans = 0x3f3f3f3f;
    for(int i = 0;i<5;++i) a[i] = i;
    while(scanf("%d",&arr[n])==1)
    {
        ans = 0x3f3f3f3f;
        if(arr[n]==0)
        {
            break;
        }
        n++;
        while(scanf("%d",&arr[n])==1)
        {
            if(arr[n]==0)
            {
                n--;
                break;
            }
            n++;
        }
        memset(dp,0x3f,sizeof(dp));
        dp[0][0][0] = 0;
        for(int k = 1;k<=n;++k)
        {
            for(int i = 0;i<5;++i)
            {
                for(int j = 0;j<5;++j)
                {
                    dp[k][i][arr[k]] = min(dp[k][i][arr[k]],dp[k-1][i][j] + mov(j,arr[k]));
                    dp[k][arr[k]][j] = min(dp[k][arr[k]][j],dp[k-1][i][j] + mov(i,arr[k]));
                }
            }
        }
        for(int i = 0;i<5;++i)
            ans = min(dp[n][arr[n]][i],ans),ans=min(dp[n][i][arr[n]],ans);
        printf("%d\n",ans);
        n = 1;
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}