Description

#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。

Input

First a integer T(T<=10000),then T lines follow, every line has three positive integer L,R,K.(

0<L<=R<2
63-1 and 1<=K<=10).

Output

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.

Sample Input

1
123 321 2

Sample Output

Case #1: 139 

题目的大概意思就是让你统计在给定区间内,符合要求的数的个数。 一个数如果它的各个数位的最长上升子序列(LIS)长度为k,那么它就是符合要求的。
这题分为三个点。
1.首先这个题符合区间减法,我们只需要求出0~l-1和0~r的合法数的个数,再做减法即可。
2.对LIS的处理我们采用状态压缩来处理
LIS状压:
这个数的二进制的第i个1的位置表示当前序列长度为i的LIS最后一位最小是多少。这样1的个数就是LIS的长度
比如010101101(从左到右,每一位代表0~9)表示这个序列以9结尾(最后一个1在9的位置)
上升子序列长度分别为1,2,3,4,5的子序列的结尾(最后一位)最小分别是2,4,6,7,9。
状态的更新:
假设现在状态为0100100110,最长序列为1 4 7 8,如果我们下一个dp位的值为6,那么长度为3的上升子序列就由原来的1 4 7,变为1 4 6。
相应的我们更新后状态为010010010,相当于6把7在二进制数上替换了(红色)。
3.剩下的交给深搜...
 #include <bits/stdc++.h>

 using namespace std;
long long dp[][<<][];
//dp[i][j][k] ,i为当前进行到的数位,j状态压缩,k要求的上升子序列的度
int k,bit[];
int getnews(int x,int s)//更新状态
{
for (int i=x;i<;++i)
if (s&<<i) return (s^(<<i)|(<<x));//让x替换x位后的第一个数
return s|(<<x);//如果x最大,将x对应位变为1
}
int getnum(int s)//求出当前状态LIS的长度也就是1的个数
{
int ret=;
while (s)
{
if (s&)
ret++;
s>>=;
}
return ret;
}
long long dfs (int pos,int s,bool e,bool z)
//pos表示处理过的位置,s表示LIS的状态,e表示是否到达边界,z表示前面的所有位是否全为0
{
if (pos==-) return getnum(s)==k;
if (!e&&dp[pos][s][k]!=-) return dp[pos][s][k];
long long ans=;
int endd=e?bit[pos]:;
for (int i=;i<=endd;++i)
ans+=dfs(pos-,(z&&i==)?:getnews(i,s),e&&i==endd,z&&(i==));
if (!e) dp[pos][s][k]=ans;
return ans;
}
long long calc (long long n)
{
int len=;
while (n)
{
bit[len++]=n%;
n/=;
}
return dfs(len-,,,);
}
int main()
{
//freopen("de.txt","r",stdin);
int t;
long long l,r;
memset(dp,-,sizeof dp);
scanf("%d",&t);
int casee=;
while (t--)
{
scanf("%I64d%I64d%d",&l,&r,&k);
printf("Case #%d: ",++casee);
printf("%I64d\n",calc(r)-calc(l-));
}
return ;
}

结尾自满一下,这个题网上应该没有人比我写的题解详细,虽然我也是基本上照搬kuangbin大神的模板,再看看网上的题解综合自己的想法写出来的。

 

hdu 4352 XHXJ's LIS (数位dp+状态压缩)的更多相关文章

  1. hdu 4352 XHXJ's LIS 数位dp+状态压缩

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4352 XHXJ's LIS Time Limit: 2000/1000 MS (Java/Others ...

  2. HDU 4352 XHXJ's LIS 数位dp lis

    目录 题目链接 题解 代码 题目链接 HDU 4352 XHXJ's LIS 题解 对于lis求的过程 对一个数列,都可以用nlogn的方法来的到它的一个可行lis 对这个logn的方法求解lis时用 ...

  3. HDU 4352 XHXJ's LIS (数位DP+LIS+状态压缩)

    题意:给定一个区间,让你求在这个区间里的满足LIS为 k 的数的数量. 析:数位DP,dp[i][j][k] 由于 k 最多是10,所以考虑是用状态压缩,表示 前 i 位,长度为 j,状态为 k的数量 ...

  4. HDU.4352.XHXJ's LIS(数位DP 状压 LIS)

    题目链接 \(Description\) 求\([l,r]\)中有多少个数,满足把这个数的每一位从高位到低位写下来,其LIS长度为\(k\). \(Solution\) 数位DP. 至于怎么求LIS, ...

  5. $HDU$ 4352 ${XHXJ}'s LIS$ 数位$dp$

    正解:数位$dp$+状压$dp$ 解题报告: 传送门! 题意大概就是港,给定$[l,r]$,求区间内满足$LIS$长度为$k$的数的数量,其中$LIS$的定义并不要求连续$QwQ$ 思路还算有新意辣$ ...

  6. hdu 4352 XHXJ's LIS 数位DP+最长上升子序列

    题目描述 #define xhxj (Xin Hang senior sister(学姐))If you do not know xhxj, then carefully reading the en ...

  7. hdu 4352 XHXJ's LIS 数位DP

    数位DP!dp[i][j][k]:第i位数,状态为j,长度为k 代码如下: #include<iostream> #include<stdio.h> #include<a ...

  8. HDU 4352 - XHXJ's LIS - [数位DP][LIS问题]

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4352 Time Limit: 2000/1000 MS (Java/Others) Memory Li ...

  9. hdu 4352 XHXJ's LIS(数位dp+状压)

    Problem Description #define xhxj (Xin Hang senior sister(学姐)) If you do not know xhxj, then carefull ...

  10. HDU 4352 XHXJ's LIS ★(数位DP)

    题意 求区间[L,R]内满足各位数构成的数列的最长上升子序列长度为K的数的个数. 思路 一开始的思路是枚举数位,最后判断LIS长度.但是这样的话需要全局数组存枚举的各位数字,同时dp数组的区间唯一性也 ...

随机推荐

  1. Delphi fmx 找不到android设备解决办法

    刚接触到移动开发,很多不熟悉.配置好Android SDK后,​​如果​用模拟器来调试程序的话,那速度会让人崩溃,我用的Nexus7平板​​,插上电脑,开启USB调试,但奇怪在Delphi里就是找不到 ...

  2. 【Java】字符串转json

    import org.json.JSONObject; JSONObject jo = new JSONObject(new String(需要转换的字符串));

  3. cordova打包apk流程

    一.打包 条件: 1.java-jdk 2.Android-sdk  ( 安装教程:https://blog.csdn.net/qq_36577136/article/details/80632674 ...

  4. mysql 一条sql完成saveOrUpdate 存在即更新

    关键字 on duplicate key update <pre name="code" class="sql"> insert into tabl ...

  5. 如何用javascript中的canvas让图片自己旋转

    最近在写一个游戏,想让一个人物随着鼠标在原地旋转 在网上找了找,大都是用css写的,但是我为了长远的利益着想选择使用javascript代码中的canvas来解决绘图问题 其中重要的两个方法: con ...

  6. tensorflow队列tf.FIFOQueue | enqueue | enqueue_many | dequeue | dequeue_many

    关于队列的相关知识,盗用一张https://blog.csdn.net/HowardWood/article/details/79406891的动态图 import tensorflow as tf ...

  7. 多线性方程组迭代算法——Gauss-Seidel迭代算法的Python实现

    多线性方程组(张量)迭代算法的原理请看这里:原理部分请留言,不方便公开分享 Jacobi迭代算法里有详细注释:多线性方程组迭代算法——Jacobi迭代算法的Python实现 import numpy ...

  8. 46-python基础-python3-字符串-常用字符串方法(四)-join()-split()

    5-字符串方法 join()和 split() 1-join()方法 将字符串列表连接成一个单独的字符串. join()方法在一个字符串上调用,参数是一个字符串列表,返回一个字符串. 请注意,调用 j ...

  9. Yii 1.1 cookie删不掉

    我的cookie是这样设置的: $cookie = new CHttpCookie('username','Jack'); $cookie->expire = time()+60*60*24*3 ...

  10. 使用autoconf和automake生成Makefile

    使用环境: 我的是Ubuntu 16.04,需要用到autoconf和automake,没有的话自行安装. 以helloworld为例: 1.首先新建一个文件夹然后进去没的说:然后自然得先写出那个著名 ...