设
f[i][j][k]
表示前i位已经匹配完,目前第i+1位为j,第i+2位为k的最小值。
则可以由第i位推到第i+1位的状态,若令t为j到tar[i+1]的步数,则
f[i][j][k]+t→f[i+1][k+p][num[i+3]+q]
,其中
q<=p<=t
,正确性显然。
故时间复杂度为
O(103n)
,可开滚动数组优化空间。
hdu的数据太水了!
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
int nxt[11][11] , pre[11][11];
char _num[1005] , _tar[1005];
int f[1005][10][10] , n , num[1005] , tar[1005];
void init() {
rep (i , 0 , 9) rep (j , 0 , 9) {
nxt[i][j] = (j - i + 10) % 10;
pre[i][j] = (i - j + 10) % 10;
}
}
inline void upmin(int&a , int b) { if (a > b) a = b ; }
inline int _nxt(int i , int j) { return (i + j + 10) % 10 ; }
inline int _pre(int i , int j) { return (i - j + 10) % 10 ; }
void input() {
n = strlen(_num + 1);
rep (i , 1 , n) num[i] = _num[i] - '0';
rep (i , 1 , n) tar[i] = _tar[i] - '0';
}
void solve() {
memset(f , 0x3f , sizeof f);
int inf = f[0][0][0];
f[0][num[1]][num[2]] = 0;
rep (i , 0 , n - 1) rep (j , 0 , 9) rep (k , 0 , 9) if (f[i][j][k] != inf) {
int t = nxt[j][tar[i + 1]];
rep (p , 0 , t) rep (q , 0 , p)
upmin(f[i + 1][_nxt(k , p)][_nxt(num[i + 3] , q)] , f[i][j][k] + t);
t = pre[j][tar[i + 1]];
rep (p , 0 , t) rep (q , 0 , p)
upmin(f[i + 1][_pre(k , p)][_pre(num[i + 3] , q)] , f[i][j][k] + t);
}
int ans = inf;
rep (i , 0 , 9) rep (j , 0 , 9)
upmin(ans , f[n][i][j]);
printf("%d\n" , ans);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("data.txt" , "r" , stdin);
#endif
init();
while (scanf("%s%s" , _num + 1 , _tar + 1) == 2) {
input();
solve();
}
return 0;
}