很暴力的一个dp,dp[i][j][k] 表示的是第i位时,前i-1位都匹配后,当由前面的状态推出第i位+j,i+1位+k时最少用多少步。注意up和down要分开算。。
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define CLR(a, b) memset(a, b, sizeof(a))
using namespace std;
const int N = 1111;
int dp[N][11][11];
char a[N], b[N];
int main()
{
int n, i, j, k, s, t, up, dw;
while(cin >> a >> b)
{
n = strlen(a);
memset(dp, 0x3f3f, sizeof(dp));
dp[0][0][0] = 0;
for(i = 0; i < n; i ++)
{
for(j = 0; j < 10; j ++)
{
for(k = 0; k < 10; k ++)
{
up = (b[i] - a[i] - j + 20) % 10;
dw = (10 - up) % 10;
for(s = 0; s <= up; s ++)
{
for(t = 0; t <= s; t ++)
{
dp[i + 1][(k + s) % 10][t] =
min(dp[i + 1][(k + s) % 10][t], dp[i][j][k] + up);
}
}
for(s = 0; s <= dw; s ++)
{
for(t = 0; t <= s; t ++)
{
dp[i + 1][(k - s + 10) % 10][(10 - t) % 10] =
min(dp[i + 1][(k - s + 10) % 10][(10 - t) % 10], dp[i][j][k] + dw);
}
}
}
}
}
cout << dp[n][0][0] << endl;
}
}