搜索大法好,基本上是裸的记忆化搜索
代码
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int l,r;
int f[50][20],lim[50];
int dfs(int len,int last,bool jud)
{
if (len<1) return 1;
if (!jud&&f[len][last]!=-1) return f[len][last];
int emm=(jud?lim[len]:9);int cnt=0;
for (int i=0;i<=emm;i++)
{
if (abs(i-last)<2) continue;
if (last==-10&&i==0) cnt+=dfs(len-1,last,jud&&(emm==i));
else cnt+=dfs(len-1,i,jud&&(emm==i));
}
if(last>=0&&!jud) f[len][last]=cnt;
return cnt;
}
void slove(int x,int y)
{
int len=0;
while (x) lim[++len]=x%10,x/=10;
memset(f,255,sizeof(f));
int ans=dfs(len,-10,1);
len=0;
while (y) lim[++len]=y%10,y/=10;
memset(f,255,sizeof(f));
int que=dfs(len,-10,1);
cout<<ans-que;
return ;
}
signed main()
{
cin>>l>>r;slove(r,l-1);
return 0;
}