HDU-3555 Bomb (数位dp 入门题)

计数炸弹威力：数位DP解法

最新推荐文章于 2021-01-22 20:25:28 发布

Borrrrrrrrrrrram

最新推荐文章于 2021-01-22 20:25:28 发布

阅读量662

点赞数

CC 4.0 BY-SA版权

分类专栏：动态规划-数位dp 文章标签：动态规划 ACM 数位dp HDU dp

本文链接：https://blog.csdn.net/hmc0411/article/details/78604424

动态规划-数位dp 专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种使用数位动态规划的方法来解决一个特定问题：计算从1到N范围内数字序列中包含子序列49的数量，以此作为炸弹威力的点数。通过详细的代码解析和算法思路说明，帮助读者理解如何高效地解决此类问题。

Bomb

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 20547 Accepted Submission(s): 7696

Problem Description

The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the current number sequence includes the sub-sequence "49", the power of the blast would add one point.
Now the counter-terrorist knows the number N. They want to know the final points of the power. Can you help them?

Input

The first line of input consists of an integer T (1 <= T <= 10000), indicating the number of test cases. For each test case, there will be an integer N (1 <= N <= 2^63-1) as the description.

The input terminates by end of file marker.

Output

For each test case, output an integer indicating the final points of the power.

Sample Input

Sample Output

0
1
15

HintFrom 1 to 500, the numbers that include the sub-sequence "49" are "49","149","249","349","449","490","491","492","493","494","495","496","497","498","499",
so the answer is 15.

#include <bits/stdc++.h>
using namespace std;
long long dp[29][10][2];
void init(){
	memset(dp, 0, sizeof(dp));
	for(int i = 0; i <= 9; ++i){
		dp[1][i][0] = 1;
	}
	for(int i = 2; i <= 19; ++i){
		for(int j = 0; j <= 9; ++j){
			for(int k = 0; k <= 9; ++k){
				if(j == 4 && k == 9){
					dp[i][j][1] += dp[i - 1][k][0];
					dp[i][j][1] += dp[i - 1][k][1];
				}
				else{
					dp[i][j][0] += dp[i - 1][k][0];
					dp[i][j][1] += dp[i - 1][k][1];
				}
			}
		}
	}
}
int main(){
	init();
	int T;
	long long x;
	scanf("%d", &T);
	while(T--){
		cin >> x;
		x++;
		vector<int>s;
		while(x){
			s.push_back(x % 10);
			x /= 10;
		}
		int n = s.size() - 1;
		long long ans = 0;
		s.push_back(0);
		int flag = 0;
		for(int i = n; i >= 0; --i){
			for(int j = 0; j < s[i]; ++j){
				if(flag == 0)  ans += dp[i + 1][j][1];
				else ans += dp[i + 1][j][0] + dp[i + 1][j][1];
			}
			if(s[i] == 9 && s[i + 1] == 4) flag = 1;
		}
		printf("%I64d\n", ans);
	}
	return 0;
}

/*
题意：
1e18个数，问有多少个数的数位中包含连续的49。

思路：
数位dp，dp[i][j][0]表示最高位为第i位，且最高位为j时，数位中不包含49有多少种情况，
dp[i][j][1]表示最高位为第i位，且最高位为j时，数位中包含49有多少种情况。转移就很容
易写出来了。统计答案时注意如果已经出现49了，就不可以只统计包含49的情况。
*/