[SCOI2009]windy数

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
int dp[15][15],num[15];//len last
int a,b;

int dfs(int len,int last,bool shangxian,bool qdling)
{
if(len==0) return 1;
if(!qdling&&!shangxian&&dp[len][last]!=-1)
    return dp[len][last];
int p,cnt=0,maxx=(shangxian?num[len]:9);
for(int i=0;i<=maxx;i++)
{
    if(abs(i-last)<2)continue;
    p=i;
    if(qdling&&i==0) p=-233;
    cnt+=dfs(len-1,p,(shangxian)&&(i==maxx),(p==-233));
}
if(!shangxian&&!qdling) dp[len][last]=cnt;
return cnt;
}

int solve(int x)
{
int k=0;
while(x)
{
    num[++k]=x%10;
    x/=10;
}
memset(dp,-1,sizeof(dp));
return dfs(k,-233,true,true);
}

int main()
{
scanf("%d%d",&a,&b);
printf("%d\n",solve(b)-solve(a-1));
}