hdu 4352 数位dp（最长上升子序列的长度为k的个数）

#define xhxj (Xin Hang senior sister(学姐)) 
If you do not know xhxj, then carefully reading the entire description is very important.
As the strongest fighting force in UESTC, xhxj grew up in Jintang, a border town of Chengdu.
Like many god cattles, xhxj has a legendary life: 
2010.04, had not yet begun to learn the algorithm, xhxj won the second prize in the university contest. And in this fall, xhxj got one gold medal and one silver medal of regional contest. In the next year‘s summer, xhxj was invited to Beijing to attend the astar onsite. A few months later, xhxj got two gold medals and was also qualified for world‘s final. However, xhxj was defeated by zhymaoiing in the competition that determined who would go to the world‘s final(there is only one team for every university to send to the world‘s final) .Now, xhxj is much more stronger than ever，and she will go to the dreaming country to compete in TCO final.
As you see, xhxj always keeps a short hair(reasons unknown), so she looks like a boy( I will not tell you she is actually a lovely girl), wearing yellow T-shirt. When she is not talking, her round face feels very lovely, attracting others to touch her face gently。Unlike God Luo‘s, another UESTC god cattle who has cool and noble charm, xhxj is quite approachable, lively, clever. On the other hand,xhxj is very sensitive to the beautiful properties, "this problem has a very good properties"，she always said that after ACing a very hard problem. She often helps in finding solutions, even though she is not good at the problems of that type.
Xhxj loves many games such as，Dota, ocg, mahjong, Starcraft 2, Diablo 3.etc，if you can beat her in any game above, you will get her admire and become a god cattle. She is very concerned with her younger schoolfellows, if she saw someone on a DOTA platform, she would say: "Why do not you go to improve your programming skill". When she receives sincere compliments from others, she would say modestly: "Please don’t flatter at me.(Please don‘t black)."As she will graduate after no more than one year, xhxj also wants to fall in love. However, the man in her dreams has not yet appeared, so she now prefers girls.
Another hobby of xhxj is yy(speculation) some magical problems to discover the special properties. For example, when she see a number, she would think whether the digits of a number are strictly increasing. If you consider the number as a string and can get a longest strictly increasing subsequence the length of which is equal to k, the power of this number is k.. It is very simple to determine a single number’s power, but is it also easy to solve this problem with the numbers within an interval? xhxj has a little tired，she want a god cattle to help her solve this problem,the problem is: Determine how many numbers have the power value k in [L，R] in O(1)time.
For the first one to solve this problem，xhxj will upgrade 20 favorability rate。

First a integer T(T<=10000),then T lines follow, every line has three positive integer L,R,K.(
0<L<=R<2⁶³-1 and 1<=K<=10).

For each query, print "Case #t: ans" in a line, in which t is the number of the test case starting from 1 and ans is the answer.

1
123 321 2

Case #1: 139 

/**
hdu 4352  数位dp（最长上升子序列的长度为k的个数）
题目大意：求出给定区间内的数把该数看做一个序列，求出有多少个数满足最长上升子序列的长度为k
解题思路：利用数位dp记忆化搜索来求解。由于最长上升子序列的数字都是0~9，而且k为1~10，我们把当前状态表示为状态s
           dp[i][j][k]:i为当前进行到的数位，j状态压缩，为10个数字出现过的，其中1的个数就是最长上升子序列，k要求
           的上升子序列的长度
*/
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
typedef long long LL;
int k;
LL dp[25][1<<10][11];

int getnews(int x,int s)///模仿nlogn算法求最长上升子序列
{
    for(int i=x; i<10; i++)
    {
        if(s&(1<<i))
            return (s^(1<<i))|(1<<x);
    }
    return s|(1<<x);
}

int getnum(int s)
{
    int ret=0;
    while(s)
    {
        if(s&1)ret++;
        s>>=1;
    }
    return ret;
}

int bit[25];

LL dfs(int pos,int s,bool flag,bool z)
{
    if(pos==-1) return getnum(s)==k;
    if(!flag&&dp[pos][s][k]!=-1) return dp[pos][s][k];
    LL ans=0;
    int end=flag?bit[pos]:9;
    for(int i=0; i<=end; i++)
        ans+=dfs(pos-1,(z&&i==0)?0:getnews(i,s),flag&&i==end,z&&(i==0));
    if(!flag)dp[pos][s][k]=ans;
    return ans;
}

LL solve(LL n)
{
    int len=0;
    while(n)
    {
        bit[len++]=n%10;
        n/=10;
    }
    return dfs(len-1,0,1,1);
}

int main()
{
    int T,tt=0;
    LL l,r;
    memset(dp,-1,sizeof(dp));
    scanf("%d",&T);
    while(T--)
    {
        scanf("%I64d%I64d%I64d",&l,&r,&k);
        printf("Case #%d: %I64d\n",++tt,solve(r)-solve(l-1));
    }
    return 0;
}