HDU 3555 Bomb 数位DP

题意：给一个炸弹，当计时器当前值中包含连续的49时炸弹威力加1，给出计时器初始值，求出炸弹总威力
思路：数位DP，记录上一位是否为4，若满足条件且当前位为9，直接加上当前长度的十的len次方个数，比如500内满足十位数4个位数9的有49，149，249，349，449共5个，百位数为4十位数为9的有490，491，…，499共10个。若不满足则继续递归

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 30+5;
const int inf = 0x3f3f3f3f;
ll dis[maxn], dp[100][3], n;
ll dfs(int len, int sta, int lim)
{
	if (len == -1) return 0;
	if (!lim && dp[len][sta] != -1)
		return dp[len][sta];
	ll res = 0;
	int up = lim ? dis[len] : 9;
	for (int i = 0; i <= up; i++) {
		if (sta && i == 9) 
			res += lim ? n%(ll)pow(10, len)+1 : pow(10, len);
		else
			res += dfs(len-1, i == 4, lim && i == up);
	}
	if (lim) return res;
	else return dp[len][sta] = res;
}
ll solve(ll x)
{
	int len = 0;
	while (x) {
		dis[len++] = x%10;
		x /= 10;
	}
	return dfs(len-1, 0, 1);
}
int main()
{
	int T;
	cin >> T;
	memset(dp, -1, sizeof(dp));
	while (T--) {
		cin >> n;
		cout << solve(n) << "\n";
	}
	return 0; 
}