CodeForces 331C3

数位dp
dp[len][a][b][c]
长度为len第一个数字为b，最后为数字为c，中间全部为0的十进制数，前缀最大数字为a，消减为
长度为len最后为数字为c1

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int N=11;
typedef __int64 LL;

LL dp[N*2][N][N][N];
int last[N*2][N][N][N];
void pri(int aa[N],int n){
    for(int i=0;i<n;i++){
        printf("%d%c",aa[i],i==n-1?'\n':' ');
    }
}
int check(int len,int a,int b,int c){
    int mx=max(a,max(b,c));
    if(c>=mx)return 1;
    if(len==1||b==0)return 0;
    return 1;
}


LL getdp(int,int,int,int);
int bb[N*2];
LL gun(int aa[N],int len,int a,int &bns){

    for(int i=0;i<len;i++){
        if(i==0)bb[i]=a;
        else bb[i]=max(bb[i-1],aa[i-1]);
    }
    LL ans=0;
    bns=aa[len-1];
    for(int i=len-1;i>=0;i--){
        ans+=getdp(len-i,bb[i],aa[i],bns);
        bns=last[len-i][bb[i]][aa[i]][bns];
        //printf("%d\n",bns);
    }
    return ans;
}

int aa[N*2];
LL fun(int len,int a,int b,int c,int &bns){

    int mx=max(a,max(b,c));
    for(int i=0;i<len;i++){
        if(i==0)aa[i]=b-1;
        else if(i==len-1){
            aa[i]=10+c-mx;
        }
        else {
            aa[i]=9;
        }
    }
    return gun(aa,len,a,bns)+1;
}

LL getdp(int len,int a,int b,int c){

    LL &ans=dp[len][a][b][c];
    int &bns=last[len][a][b][c];
    if(ans!=-1){
        //printf("%d %d %d %d %I64d %d\n",len,a,b,c,ans,bns);
        return ans;
    }
    //printf("%d %d %d %d\n",len,a,b,c);
    int mx=max(a,max(b,c));
    if(!check(len,a,b,c)||mx==0){
        ans=0;bns=c;
    }
    else if(c>=mx){
        if(len==1){
            ans=getdp(len,a,b-mx,c-mx)+1;
            bns=c-mx;
        }
        else {
            ans=getdp(len,a,b,c-mx)+1;
            bns=c-mx;
        }
    }
    else ans=fun(len,a,b,c,bns);
    //printf("%d %d %d %d %I64d %d\n",len,a,b,c,ans,bns);
    return ans;
}

int cc[N];
LL pai1(int n){
    LL ans=0;
    while(n){
        int nn=n,mx=0;
        while(nn){
            mx=max(mx,nn%10);nn/=10;
        }
        ans++;
        n-=mx;
    }
    return ans;
}

LL pai(LL n){
    int len=0;
    while(n){
        cc[len++]=n%10;
        n/=10;
    }
    for(int i=0;i<len/2;i++){
        swap(cc[i],cc[len-1-i]);
    }
    //pri(cc,len);
    int a=1e8;
    printf("%I64d\n",gun(cc,len,0,a));
    return a;
}

int main(){
    #ifdef DouBi
    freopen("in.cpp","r",stdin);
    #endif // DouBi
    memset(dp,-1,sizeof(dp));
    LL n;
    for(int i=1;i<=20;i++){
        for(int j=0;j<=9;j++){
            for(int k=0;k<=9;k++){
                if(i==1){
                    getdp(i,j,k,k);
                }
                else {
                    for(int k1=0;k1<=9;k1++){
                        getdp(i,j,k,k1);
                    }
                }
                //printf("%d %d %d\n",i,j,k);
            }
        }
    }
    //printf("line\n");
    while(scanf("%I64d",&n)!=EOF){
        pai(n);
    }
    return 0;
}