UESTC 1307 windy数 数位DP

简单数位DP，用dp[index][front][fg]标记，三维分别为搜到的深度，当前深度的前一个数，前面是否全部为0,。

 

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <queue>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <stack>
using namespace std;
#define ll long long
#define int64 __int64
#define M 100005
#define N 1005
#define inf 1000010
#define mod 1000000007

int num[25] , dp[25][15][2];

int Dfs(int index , int front , int lim , int fg)
{
	if (!index)return 1;
	int i , up = lim ? num[index] : 9;
	if (!lim && dp[index][front][fg] != -1)return dp[index][front][fg];
	int ret = 0;
	for (i = 0 ; i <= up ; i++)
	{
		if (!fg)ret += Dfs(index-1 , i , lim&&i==up , !(i==0&&!fg));
		else if (abs(i-front) >= 2)ret += Dfs(index-1 , i , lim&&i==up , 1);
	}
	if (!lim)dp[index][front][fg] = ret;
	return ret;
}

int Solve(int k)
{
	int len = 0;
	while (k)
	{
		num[++len] = k%10;
		k /= 10;
	}
	return Dfs(len,0,1,0);
}

int main()
{
	int A , B;
	memset(dp , -1 , sizeof dp);
	while (~scanf("%d%d",&A,&B))printf("%d\n",Solve(B)-Solve(A-1));
	return 0;
}