I - Invoker ( 字符串 DP )

I - Invoker ( 字符串 DP )

思路： "YVG…"代表不同的技能，每个技能有对应的三个按键，按键的顺序任意，每次需要按下R才能发动技能，发动完技能已有的按键不会消失，每次最多存三个按键（R不算）。求最少的按键次数。

比如YV代表两个技能QQQ和QQW， 我们只需要QQQRWR，就可以。
因为按键可以保留，那么我们尽量让本次的按键对下次技能的按键保留的最多。
但是由于技能之间的按键顺序可以任意，所以我们dp按键组合。
因为一个技能有三个键，所以可以产生六种排序方式（完全相同的也算上）。
dp[i][j]表示第i个技能使用第j种排序方式的按键数，这样我们可以得出方程dp[i][j]=min(dp[i][j],dp[i-1][k]+(第i-1个技能使用第j种排序方式和第i个技能使用第k种排序方式的差值))。

代码：

#include <bits/stdc++.h>

using namespace std;

char way[10][6][4]={
    "QQQ","QQQ","QQQ","QQQ","QQQ","QQQ",
    "QQW","QWQ","WQQ","WQQ","WQQ","WQQ",
    "QQE","QEQ","EQQ","EQQ","EQQ","EQQ",
    "WWW","WWW","WWW","WWW","WWW","WWW",
    "QWW","WQW","WWQ","WWQ","WWQ","WWQ",
    "WWE","WEW","EWW","EWW","EWW","EWW",
    "EEE","EEE","EEE","EEE","EEE","EEE",
    "QEE","EQE","EEQ","EEQ","EEQ","EEQ",
    "WEE","EWE","EEW","EEW","EEW","EEW",
    "QWE","QEW","EQW","EWQ","WEQ","WQE",
};

map<char,int>m;
int dp[100005][10];
char a[100005];

int dis( char a[], char b[] )
{
    if ( a[0]==b[0]&&a[1]==b[1]&&a[2]==b[2] ) {
        return 0;
    }
    else if ( a[1]==b[0]&&a[2]==b[1] ) {
        return 1;
    }
    else if ( a[2]==b[0] ) {
        return 2;
    }
    return 3;
}

int main()
{
    m['Y']=0;m['V']=1;m['G']=2;
    m['C']=3;m['X']=4;m['Z']=5;
    m['T']=6;m['F']=7;m['D']=8;
    m['B']=9;
    memset(dp,0x3f3f3f3f,sizeof(dp));
    for ( int i=0; i<6; i++ ) dp[0][i] = 3;
    cin >> a;
    int len = strlen(a);
    for ( int i=1; i<len; i++ ) { // 第i个技能
        for ( int j=0; j<6; j++ ) { // 第j种方式
            for ( int x=0; x<6; x++ ) { // dp[i-1]的六中组合方式
                dp[i][j] = min( dp[i][j], dp[i-1][x]+dis(way[m[a[i]]][j],way[m[a[i-1]]][x]) );
            } // 状态迁移方程|
        }
    }
    int ans = 0x3f3f3f3f;
    for ( int i=0; i<6; i++ ) {
        ans = min(ans,dp[len-1][i]);
    }
    cout << ans+len << endl; // 每个技能都需要按一下R，sy加上len就是R的总数

    return 0;
}