题目链接
这个题,只要有回文串就行了,其最低要求:
当前位数数字与上一位或上上一位相同。
我们设:
dp[i][pre1][pre2][k][gg],为前i位数,最后一个数字为pre2,倒数第二个数字为pre1。已经有匹配回文串(k == 1)或还没匹配到回文串(k == 0)的个数。其中gg为当前数字去掉前导0后的位数。(全部为0时gg ==0,有一位数gg == 1, 大于一位 gg == 2)
由此可以进行dp
下面是ac代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <queue>
#include <map>
#include <vector>
#define ll long long
using namespace std;
const ll mod = 1e9+7;
ll dp[1005][10][10][2][3];
char su[1005];
int len;
ll dfs(int cur, int gg, int pre1, int pre2, int k, bool flag)
{
if (cur >= len) return k;
if (!flag&&dp[cur][pre1][pre2][k][gg] != -1) return dp[cur][pre1][pre2][k][gg];
int mx = flag?su[cur]-'0':9;
ll ans = 0;
for (int i = 0; i <= mx; i++)
{
if (k == 1)
ans = (ans + dfs(cur+1, 2, pre2, i, 1, flag&&i==mx))%mod;
else
{
if (i==0&&gg==0)
ans = (ans + dfs(cur+1, 0, 0, 0, 0, flag&&i==mx))%mod;
else
{
if (gg == 0)
ans = (ans + dfs(cur+1, 1, 0, i, 0, flag&&i==mx)) % mod;
else if (gg == 1)
{
if (i == pre2)
ans = (ans + dfs(cur+1, 2, pre2, i, 1, flag&&i==mx))%mod;
else
ans = (ans + dfs(cur+1, 2, pre2, i, 0, flag&&i==mx))%mod;
}
else
{
if (i==pre1 || i == pre2)
ans = (ans + dfs(cur+1, 2, pre2, i, 1, flag&&i==mx))%mod;
else
ans = (ans + dfs(cur+1, 2, pre2, i, 0, flag&&i==mx))%mod;
}
}
}
}
if (!flag) dp[cur][pre1][pre2][k][gg] = ans;
return ans;
}
int main()
{
memset(dp, -1, sizeof(dp));
scanf("%s", su);
len = strlen(su);
ll ansl = dfs(0, 0, 0, 0, 0, 1) % mod;
ll flag = 0;
for (int i = 0; i < len-1; i++)
{
if (su[i] == su[i+1] || su[i] == su[i+2]) flag = 1;
}
scanf("%s", su);
len = strlen(su);
memset(dp, -1, sizeof(dp));
ll ansr = dfs(0, 0, 0, 0, 0, 1) % mod;
//cout << ansr <<" " << ansl << endl;
printf("%lld\n", ((ansr - ansl + mod)%mod + flag) % mod);
return 0;
}