【题解】HDU 4532 XHXJ's LIS 数位dp

题面&题解

注意：
lis用记录每个长度的末尾的方法求，性质是每个末尾严格递增，所以可以简化状态！
前导0可以直接在处理lis的转移的时候特判
需要把k相同的询问放在一起，然后预处理（或者分开记忆化）不顶上界的情况。否则会TLE！

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(register int i = l ; i <= r ; i++)
#define repd(i,r,l) for(register int i = r ; i >= l ; i--)
#define rvc(i,S) for(register int i = 0 ; i < (int)S.size() ; i++)
#define rvcd(i,S) for(register int i = ((int)S.size()) - 1 ; i >= 0 ; i--)
#define fore(i,x)for (register int i = head[x] ; i ; i = e[i].next)
#define forup(i,l,r) for (register int i = l ; i <= r ; i += lowbit(i))
#define fordown(i,id) for (register int i = id ; i ; i -= lowbit(i))
#define pb push_back
#define prev prev_
#define stack stack_
#define mp make_pair
#define fi first
#define se second
#define lowbit(x) (x&(-x))

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pr;

const ll inf = 2e18;
const int N = 3e6 + 10;
const int maxn = 2020;
const ll mod = 998244353;

int trans[maxn][10],lis[maxn];
int vis[20][maxn][2],a[20],b[20],cnt,len;
ll f[20][maxn][2],l,r,ans[maxn * 10];
int T,k,S = 1023,times,times2;
struct node{
	ll l,r; int id;
};
vector <node> vec[20];

void get(int x){
	len = 0;
	rep(i,0,9){
		if ( x & (1 << i) ) a[++len] = i;
	}
}
int code(int a[],int l){
	int res = 0;
	rep(i,1,l) res += 1 << a[i];
	return res;
}
void init(){
	rep(i,0,S){
		get(i);
		lis[i] = len;
		rep(j,0,9){
			memcpy(b,a,sizeof(b)); int l = len;
			if ( !(i & (1 << j)) ){
				rep(k,1,len) if ( j < b[k] ){ b[k] = j; break; }
				if ( j > b[len] || !len ) b[++l] = j;
			}
			trans[i][j] = code(b,l);
		}
	}
	trans[0][0] = 0; //通过限制lis状态的转移，特判前导0
}
ll DP(int n,int t,int S){
	if ( !n ) return lis[S] == k;
	if ( lis[S] > k ) return 0;
	if ( !t ){
	   	if (vis[n][S][t] == times2 ) return f[n][S][t];
		else vis[n][S][t] = times2;
	}
	if ( t ){
		if ( vis[n][S][t] == times ) return f[n][S][t];
		else vis[n][S][t] = times;
	}
	ll &res = f[n][S][t] = 0; 
	if ( t ){
		rep(i,0,a[n] - 1) res += DP(n - 1,0,trans[S][i]);
		res += DP(n - 1,1,trans[S][a[n]]);
	}
	else{
		rep(i,0,9) res += DP(n - 1,0,trans[S][i]);
	}
	return res;
}
inline ll solve(ll n){
	cnt = 0 , ++times;
	while ( n ) a[++cnt] = n % 10 , n /= 10;
	return DP(cnt,1,0);
}
int main(){
	init();
	scanf("%d",&T);
	rep(t,1,T){
		scanf("%lld %lld %d",&l,&r,&k);
		vec[k].pb((node){l,r,t});
		//	printf("Case #%d: %lld\n",t,solve(r) - solve(l - 1));
	}
	rep(i,1,10){
		++times2;
		k = i;
		rvc(j,vec[i]){
			ans[vec[i][j].id] = solve(vec[i][j].r)- solve(vec[i][j].l - 1);
		}
	}
	rep(t,1,T) 	printf("Case #%d: %lld\n",t,ans[t]);
}