DP(数位专题⑧)

题意: 给定区间[l, r], 求在区间内符合下列条件的数的个数

• 有三个数字连续且相等
• 8和4不能同时出现

>> face <<

Strategy: 区间查询显然数位dp, 同前面类似的题一样, dfs一搜就完了

状态: $dp[i][j][k][l][m][n][o]\to$ 目前搜到第i位, 上两位填的数分别是j和k, 以及目前这个数符不符合题意l, 有没有前导零m, 填过8没有n,填过4没有;

目标: $(sum[r])(sum[i]代表1i内的所有合法数的个数)$

边界: 没有

合法判断: 条件转移合法判断

记忆化转移无需预处理

attention: 状态的唯一性

双倍经验: 当发现wa的时候有可能是状态太泛了, (在空间复杂度允许的情况下)可以试着把dfs的参数多压几维到dp数组里面

@author: jasonleft 记忆化数位
#include <bits/stdc++.h>
#include <bits/extc++.h>
#define _rep(i, a, b) for (ll i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (ll i = (a); i >= (b); --i)
#define _for(i, a, b) for (ll i = (a); i < (b); ++i)
#define _rof(i, a, b) for (ll i = (a); i > (b); --i)
#define ll long long
#define db double
#define oo 0x3f3f3f3f
#define eps 0.00001
#define all(x) x.begin(), x.end()
#define met(a, b) memset(a, b, sizeof(a))
#define id(x) ((x + 8))
#define bin(x) cerr << #x << " is " << bitset<15>(x) << endl
#define what_is(x) cerr << #x << " is " << x << endl
#define lowbit(x) x &(-x)
using namespace std;
const ll maxn = 15;
ll l, r, dp[maxn][maxn][maxn][2][2][2][2], cnt, a[maxn];
ll dfs(ll cur, ll last, ll llst, ll up, bool fine, bool eight, bool four, bool zeros)
{
	if (cur == 0)
		return fine;
	ll &t = dp[cur][last][llst][fine][zeros][eight][four];
	if (!up && ~t)
		return t;
	ll ret = 0;
	_rep(i,0,  up ? a[cur] : 9)
	{
		
		if ((eight && i == 4) || (four && i == 8))
			continue;
		ret += dfs(cur - 1,zeros && i == 0 ? -1 : i,zeros && i == 0 ? -1 : last, up && i == a[cur], fine || (last == i && last == llst), eight || i == 8, four || i == 4, zeros && i == 0);
	}
	if(!up)
		t = ret;
	assert(ret >= 0);
	return ret;
}
ll ask(ll __)
{
	cnt = 0;
	met(a, 0);//, met(dp, -1);
	while (__)
		a[++cnt] = __ % 10, __ /= 10;
	
	return dfs(cnt, -1, -1, 1, 0, 0, 0, 1);
}
signed main()
{
	ios::sync_with_stdio(0);
	cin >> l >> r;
	met(dp, -1);
	cout << ask(r) - ask(l - 1) << endl;
}