HDU 3555 Bomb【数位DP】

最新推荐文章于 2021-05-25 11:51:06 发布

Kria·L

最新推荐文章于 2021-05-25 11:51:06 发布

阅读量106

点赞数

分类专栏：数位DP

本文链接：https://blog.csdn.net/qq_43710979/article/details/90083294

版权

数位DP 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

$B o m b$

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

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
3
1
50
500

Sample Output
0
1
15

Hint
From 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.

Author
fatboy_cw@WHU

Source
2010 ACM-ICPC Multi-University Training Contest（12）——Host by WHU

问题描述：

统计1~n之间的数中含有‘49’的有多少个，数位DP模板上

两种方案：

①

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn = 34;
int T;
LL n,dp[maxn][maxn][2],num[maxn];
LL dfs(int pos,bool limit,int pre,bool ok){
    if(pos==-1) return ok;
    if(!limit&&dp[pos][pre][ok]!=-1) return dp[pos][pre][ok];
    int up = limit?num[pos]:9;
    LL res = 0;
    for(int i=0;i<=up;i++) res+=dfs(pos-1,limit&&(i==num[pos]),i,ok||(pre==4&&i==9));
    if(!limit) dp[pos][pre][ok] = res;
    return res;
}
LL solve(LL x){
    int pos = 0;
    while(x){
        num[pos++] = x%10;
        x/=10;
    }
    return dfs(pos-1,true,0,false);
}
int main(){
    scanf("%d",&T);
    memset(dp,255,sizeof(dp));
    while(T--){
        scanf("%lld",&n);
        printf("%lld\n",solve(n));
    }
    return 0;
}

②

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn = 34;
int T;
LL n,dp[maxn][3],num[maxn];
LL dfs(int pos,bool limit,int sta){
    if(pos==-1) return sta==2;
    if(!limit&&dp[pos][sta]!=-1) return dp[pos][sta];
    int up = limit?num[pos]:9;
    LL res = 0;
    for(int i=0;i<=up;i++){
        int tsta = 0;
        if(sta==2) tsta = 2;
        else if(sta==1&&i==9) tsta = 2;
        else if(i==4) tsta = 1;
        res+=dfs(pos-1,limit&&(i==num[pos]),tsta);
    }
    if(!limit) dp[pos][sta] = res;
    return res;
}
LL solve(LL x){
    int pos = 0;
    while(x){
        num[pos++] = x%10;
        x/=10;
    }
    return dfs(pos-1,true,0);
}
int main(){
    scanf("%d",&T);
    memset(dp,255,sizeof(dp));
    while(T--){
        scanf("%lld",&n);
        printf("%lld\n",solve(n));
    }
    return 0;
}