hdu 4352 数位dp+nlogn的LIS

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
using namespace std;
#define MOD 1000000007
typedef long long ll;
const int INF=0x3f3f3f3f;
const double eps=1e-5;
#define cl(a) memset(a,0,sizeof(a))
#define ts printf("*****\n");
const int MAXN=1005;
int n,m,tt,K;
ll dp[20][1<<11][11];
int digit[20];
int k;
ll getst(ll s,ll u,ll& xx)  // 状态转移
{
ll i,ss;
for(i=u;i<10;i++)
{
if(s&(1<<i)) break ;    //有比u大的，替换掉
}
if(i<10)
{
ss=s^(1<<i);
ss=ss^(1<<u);
}
else    //没有比u大的，u放入s中
{
xx++;
ss=s^(1<<u);
}
return ss;
}
ll dfs(int p,ll s,ll len,int fl,bool e) {    //位置，lis状态，lis长度，前导0
if (p==-1) return len==k;
if (!e &&dp[p][s][k]!=-1) return dp[p][s][k];
ll res = 0;
int u=e?digit[p]:9;
for (int i=0;i<=u;++i)
{
ll ns,nlen=len;
if(fl==0&&i==0) ns=0;
else    ns=getst(s,i,nlen);
res+=dfs(p-1,ns,nlen,fl||i!=0,e&&i==u);
}
return e?res:dp[p][s][k]=res;
}
ll solve(ll n)
{
int len=0;
while(n)
{
digit[len++]=n%10;
n/=10;
}
return dfs(len-1,0,0,0,1);
}
int main()
{
int i,j;
#ifndef ONLINE_JUDGE
freopen("1.in","r",stdin);
#endif
scanf("%d",&tt);
int ca=0;
memset(dp,-1,sizeof(dp));
while(tt--)
{
ll l,r;
scanf("%I64d%I64d%I64d",&l,&r,&k);
ll ans=solve(r)-solve(l-1);
printf("Case #%d: %I64d\n",++ca,ans);
}
}