hdu 4352(状压bitset+数位DP

题目链接

题目大意：给出L和R找出在[L,R]中满足最长递增子序列长度等于K的个数

LIS nlogn的原理：传送门

当前位置pos，压缩状态state肯定是要的，然后考虑到我们可以对每一个k进行DP，所以要多开一维来保存k，然后dp[i][j][k] 就是dp的状态保存，i表示考虑到当前第i位，j表示当前的压缩状态，k表示LIS恰好为k的答案。

另外LIS，考虑nlogn的方法，维护的是一个数组，在这里要严格递增，所以最长的LIS小于10，所以我们可以将这个数组用2进制压缩成一个状态，然后这个2进制1的个数就是LIS的值。bit.count()==k

 

 

///                 .-~~~~~~~~~-._       _.-~~~~~~~~~-.
///             __.'              ~.   .~              `.__
///           .'//                  \./                  \\`.
///        .'//                     |                     \\`.
///       .'// .-~"""""""~~~~-._     |     _,-~~~~"""""""~-. \\`.
///     .'//.-"                 `-.  |  .-'                 "-.\\`.
///   .'//______.============-..   \ | /   ..-============.______\\`.
/// .'______________________________\|/______________________________`.
#pragma GCC optimize("Ofast")
#pragma comment(linker, "/STACK:102400000,102400000")
#pragma GCC target(sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx) 
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
typedef long long LL;
typedef pair <int, int> ii;
const int INF=-1u>>1; 
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e6+10;
const int maxx=1e3+10;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

LL dp[20][1<<10][20];
int a[20];
int k;
bool check(int state,int k){
	bitset<10>bit=state;
	if(bit.count()==k){
		return 1;
	}
	else return 0;
}
int get_next(int state,int x){
	bitset<10>bit=state;
	int i;
	for(i=x;i<=9;i++){
		if(bit[i]==1) break;
	}
	if(i!=10) bit[i]=0;
	bit[x]=1;
	return bit.to_ulong();
}
LL dfs(int pos,int state,int k,bool lead,bool limit){
	if(pos==0){
		return check(state,k); 
	}
	if(!limit&&!lead&&dp[pos][state][k]!=-1){
		return dp[pos][state][k];
	}
	int up=limit?a[pos]:9;
	LL ans=0;
	for(int i=0;i<=up;i++){
		if(lead&&i==0) ans+=dfs(pos-1,state,k,lead,limit&&i==a[pos]);//有前导零就不统计在内  
        else{
        	int next_state=get_next(state,i);
			ans+=dfs(pos-1,next_state,k,lead&&i==0,limit&&i==a[pos]);  
		}
	}
	if(!limit&&!lead) dp[pos][state][k]=ans;  
	return ans;
}
LL calc(LL x){
	int pos=0;
	while(x){
		a[++pos]=x%10;
		x/=10;
	}
	return dfs(pos,0,k,1,1);
}
void solve(){
	LL l,r;
	S_3(l,r,k);
	print(calc(r)-calc(l-1));
}
int main(){
    //freopen( "in.txt" , "r" , stdin );
    //freopen( "data.txt" , "w" , stdout );
    int t=1;
    //init();
    s_1(t);
    me(dp,-1);
    for(int cas=1;cas<=t;cas++){
        printf("Case #%d: ",cas);
        solve();
    }
}