hdu 6739QHD dp

注意题目的无序 转移时对应相应排列方式

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
char s[maxn];
int dp[maxn][7];
map<char, string> mp;
int p[6][3] = {0, 1, 2, 0, 2, 1, 1, 2, 0, 1, 0, 2, 2, 0, 1, 2, 1, 0}; //6种排列

int calc(string s, string s1, int x, int y)
{
	int ret = 0;
	if(s[p[x][0]] == s1[p[y][0]] && s[p[x][1]] == s1[p[y][1]] && s[p[x][2]] == s1[p[y][2]]) ret = 0;
	else if(s[p[x][1]] == s1[p[y][0]] && s[p[x][2]] == s1[p[y][1]]) ret = 1;
	else if(s[p[x][2]] == s1[p[y][0]]) ret = 2;
	else ret = 3;
	return ret;
}

int main()
{
    mp['Y'] = "QQQ", mp['V'] = "QQW", mp['G'] = "QQE", mp['C'] = "WWW", mp['X'] = "QWW", mp['Z'] = "WWE", mp['T'] = "EEE", mp['F'] = "QEE", mp['D'] = "WEE", mp['B'] = "QWE";
    while(~scanf("%s", s))
    {
        memset(dp, 0x3f, sizeof(dp));
        int len = strlen(s);
        int ans = 0x3f3f3f;
        for(int j = 0; j <= 5; ++j)
            dp[1][j] = 4;
        for(int i = 2; i <= len; ++i)
        {
            for(int j = 0; j <= 5; ++j)
            {
                 for(int k = 0; k <= 5; ++k)
                 {
                     dp[i][j] = min(dp[i][j], dp[i - 1][k] + calc(mp[s[i - 2]], mp[s[i -1]], k, j) + 1);
                 }
            }
        }
        for(int i = 0; i <= 5; ++i)
            ans = min(ans, dp[len][i]);
       cout<<ans<<endl;
    }
    return 0;
}

hdu4055

#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
const int N=1e3+5;
long long dp[N][N],sum[N];
char s[N];
int main()
{
    while(~scanf("%s",s+1))
    {
        int n=strlen(s+1);
        for (int i=0; i<n+1; i++)
        {
            for (int j=0; j<+n; j++)
            {
                dp[i][j]=0;
            }
        }
        dp[0][1]=1;
        for (int i=1; i<=n; i++)
        {

            for(int j = 1; j<=i+1; j++)
                sum[j] = sum[j-1] + dp[i-1][j];
            for(int j = 1; j<=i+1; j++)
            {
                if(s[i] == 'I')
                    dp[i][j] = sum[j-1];
                else if(s[i] == 'D')
                    dp[i][j] = sum[i]-sum[j-1];
                else
                    dp[i][j]=sum[i];
                dp[i][j]%=mod;
            }
        }
        long long ans=0;
        for (int i=1; i<=n+1; i++)
            ans=(ans+dp[n][i])%mod;
        cout<<ans%mod<<endl;

    }
    return 0;
}