HDU6739 2019CCPC秦皇岛赛区 I. Invoker

题目：http://acm.hdu.edu.cn/showproblem.php?pid=6739
思路：暴力dp
           一个special skill最多有6种排列组合
          将前后两个技能进行36种组合配对
          即
          dp [ i ] [ j ] ( j 为 s [ i ] 的排列组合 0 <= j <= 5 )
          =min( dp [ i ] [ j ] , dp [ i - 1 ] [ k ] ( k 为 s [ i - 1 ] 的排列组合 0 <= k <= 5 ) + s [ i - 1 ] 的第 k 种排列组合与是 s [ i ] 的第 j
          种排列组合的两个技能连发的最少按键值

#include<bits/stdc++.h>
using namespace std;
];
map<char,int>mp;
][][]={
                    "QWE","QEW","WQE","WEQ","EQW","EWQ",
                    "WWW","WWW","WWW","WWW","WWW","WWW",
                    "WEE","WEE","EWE","EEW","EWE","EEW",
                    "QEE","QEE","EQE","EEQ","EQE","EEQ",
                    "QQE","QEQ","QQE","QEQ","EQQ","EQQ",
                    "EEE","EEE","EEE","EEE","EEE","EEE",
                    "QQW","QWQ","QQW","QWQ","WQQ","WQQ",
                    "QWW","QWW","WQW","WWQ","WQW","WWQ",
                    "QQQ","QQQ","QQQ","QQQ","QQQ","QQQ",
                    "WWE","WEW","WWE","WEW","EWW","EWW",
                  };
][];
int cmp(int a,int b,int c,int d)
{
    ;
    ]==p[c][d][]&&p[a][b][]==p[c][d][]) ;
    ]==p[c][d][]) ;
    ;
}
int main()
{
    mp[,mp[,mp[,mp[,mp[,mp[,mp[,mp[,mp[,mp[;
    while(~scanf("%s",s))
    {
        ;s[i];i++)
            ;j<;j++)
                dp[i][j]=(i+)*+i+;
        ;i<;i++) dp[][i]=;
        ;s[i];i++)
            ;j<;j++)
                ;k<;k++)
                    dp[i][j]=min(dp[i][j],dp[i-][k]+cmp(mp[s[i-]],k,mp[s[i]],j));
        int minn=0x3f3f3f3f;
        ;i<;i++) minn=min(minn,dp[strlen(s)-][i]);
        printf("%d\n",minn+strlen(s));
    }
    ;
}