windy数解决递推版数位dp

地址
水一波博客。其实也是套模板即可.

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
int dp[15][10][2][2][2];
int main()
{
    ios::sync_with_stdio(false);
    int a , b; cin >> a >> b;
    string x = to_string(a) , y = to_string(b);
    int n = y.size();
    x = string(n - x.size() , '0') + x;
    dp[0][0][1][1][1] = 1;
    for (int i = 0 ; i < n ; i++){
        for (int j = 0 ; j <= 9 ; j++){
            for (int z = 0 ; z <= 1 ; z++){
                for (int l1 = 0 ; l1 <= 1 ; l1++){
                    for (int l2 = 0 ; l2 <= 1 ; l2++){
                        if (!dp[i][j][z][l1][l2]) continue;
                        int low = (l1 ? x[i] - '0' : 0);
                        int up = (l2 ? y[i] - '0' : 9);
                        for (int d = low ; d <= up ; d++){
                            if (!z && abs(d - j) <= 1) continue;
                            int nz = (z && d == 0);
                            int nl1 = (l1 && d == low);
                            int nl2 = (l2 && d == up);
                            dp[i + 1][d][nz][nl1][nl2] += dp[i][j][z][l1][l2];
                        }
                    }
                }
            }
        }
    }
    int ans = 0;
    for (int i = 0 ; i <= 9 ; i++){
        for (int j = 0 ; j <= 1 ; j++){
            for (int k = 0 ; k <= 1 ; k++){
                for (int l = 0 ; l <= 1 ; l++){
                    ans += dp[n][i][j][k][l];
                }
            }
        }
    }
    cout << ans << endl;
    return 0;
}