HDU 4433 locker（DP）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4433

 

题意：给两个等长的字符串，每次最多可以旋转连续的三个数字，问最少需要多少次将S串转为T串

 

思路：dp[i][j][k]可以表示i位匹配完成，第i +1位变作j，i + 2位变作k所需的最少步数，当i位匹配完成后，可以枚举出i + 1位能选转的次数，然后再去更新i + 2, i + 3位

 

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <climits>
#include <functional>
#include <deque>
#include <ctime>

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")

using namespace std;

typedef long long ll;

const int maxn = 1010;
const int inf = 0x3f3f3f3f;

int dp[maxn][15][15];
char s[maxn], t[maxn];

int main()
{
    while (~scanf("%s%s", s, t))
    {
        memset(dp, inf, sizeof(dp));

        int n = strlen(s);

        dp[0][0][0] = 0;
        for (int i = 0; i < n; i++)
            for (int j = 0; j <= 9; j++)
                for (int k = 0; k <= 9; k++)
                {
                    if (dp[i][j][k] == inf) continue;

                    int up = (t[i] - s[i] - j + 20) % 10;
                    int down = 10 - up;

                    for (int u = 0; u <= up; u++)
                        for (int v = 0; v <= u; v++)
                            dp[i + 1][(k + u) % 10][v] = min(dp[i + 1][(k + u) % 10][v], dp[i][j][k] + up);

                    for (int u = 0; u <= down; u++)
                        for (int v = 0; v <= u; v++)
                            dp[i + 1][(k - u + 10) % 10][(10 - v) % 10] = min(dp[i + 1][(k - u + 10) % 10][(10 - v) % 10], dp[i][j][k] + down);
                }

        cout << dp[n][0][0] << endl;
    }
    return 0;
}