USACO2014Open Silver Odometer

Task:
Farmer John’s cows are on a road trip! The odometer on their car
displays an integer mileage value, starting at X (100 <= X <= 10^18)
miles at the beginning of their trip and ending at Y (X <= Y <= 10^18)
miles at the end of their trip. Whenever the odometer displays an
‘interesting’ number (including at the start and end of the trip) the
cows will moo. A number is ‘interesting’ if when you look at all its
digits except for leading zeros, at least half of these should be the
same. For example, the numbers 3223 and 110 are interesting, while
the numbers 97791 and 123 are not.
Help FJ count how many times the cows will moo during the trip.

SAMPLE INPUT
110 133

SAMPLE OUTPUT
14

Solution:
一道简单的数位dp题,我们可以将算[X,Y]内的有趣数转化为算[1,X),[1,Y]内的有趣数,然后通过减法算出[X,Y]内的有趣数.

好,我们定义dp[i][j][k][l],i为已经dp到第几位(从高到低),j为现在的数是否已经小于所要求的数(如果小于就能随便取了),k为现在你需要的数所占的比例(取了几次,取一次-1,取别的+1),l为现在是否还是前导零(如果有就能随便放0).

这样,我们每次枚举占一半数量的数是哪一个,就可以用数位dp来算出这些的个数了.

然而,我们将形如1122,3344等数计算了两遍(1算了1122后,2又算了1122),把他们减掉就好了.

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<string>
#define M 55
#define LL long long
using namespace std;
LL dp[M][2][M][2];
string X,Y;
LL DP(string res,int len,int de1,int de2){
    LL ret=0;
    memset(dp,0,sizeof(dp));
    dp[0][0][25][1]=1;
    for(int i=0;i<len;i++)
        for(int j=0;j<2;j++)
            for(int k=0;k<M;k++)
                for(int l=0;l<2;l++){
                    LL now=dp[i][j][k][l];
                    for(int nx=0;nx<=9;nx++){
                        if(de2!=-1&&(nx!=0||l==0)&&nx!=de2&&nx!=de1)continue;
                        if(j==0&&nx>res[i]-'0')continue;
                        int nj=j|(nx<res[i]-'0'),nk=k,nl=l;
                        nl&=(nx==0);
                        if(nl==0){
                            if(de2==-1){
                                if(de1==nx)nk--;
                                else nk++;
                            }else if(de2!=-1){
                                if(de1==nx)nk--;
                                else if(de2==nx)nk++;
                            }
                        }
                        dp[i+1][nj][nk][nl]+=now;
                    }
                }
    if(de2==-1){
        for(int i=0;i<2;i++)
            for(int j=0;j<=25;j++)
                ret+=dp[len][i][j][0];
    }else {
        for(int i=0;i<2;i++)
            ret+=dp[len][i][25][0];
    }
    return ret;
}
LL solve(string res){
    LL ret=0;
    int len=res.length();
    for(int i=0;i<=9;i++)ret+=DP(res,len,i,-1);
    for(int i=0;i<=9;i++)
        for(int j=i+1;j<=9;j++)
            ret-=DP(res,len,i,j);
    return ret;
}
int main(){
    cin>>X>>Y;
    for(int i=X.length()-1;i>=0;i--)
        if(X[i]=='0')X[i]='9';
        else {
            X[i]--;
            break;
        }
    cout<<solve(Y)-solve(X)<<endl;
    return 0;
}