HDU - 4352 XHXJ's LIS (数位DP&记忆化dfs&位运算)好题
2016-05-19 14:37
363 查看
HDU - 4352
XHXJ's LIS
SubmitStatus
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
Hint
Source
2012 Multi-University Training Contest 6
//题意:
给你一个范围[l,r],再输入一个数字k,问在再这个区间内有几个数的LIS(最长单调递增子序列长度)==k;
//思路:参考大神的代码,,,
数位DP,但是得用位运算转换一下,具体看代码
XHXJ's LIS
Time Limit: 1000MS | Memory Limit: 32768KB | 64bit IO Format: %I64d & %I64u |
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
Hint
Source
2012 Multi-University Training Contest 6
//题意:
给你一个范围[l,r],再输入一个数字k,问在再这个区间内有几个数的LIS(最长单调递增子序列长度)==k;
//思路:参考大神的代码,,,
数位DP,但是得用位运算转换一下,具体看代码
#include<stdio.h> #include<string.h> #include<algorithm> #define ll long long using namespace std; int k; ll dp[30][1<<10][12]; int New(int s,int bit) { for(int i=bit;i<=9;i++) if(s & (1 << i)) { s^=(1<<i); break; } return s | (1<<bit); } int Get(int s) { int cnt=0; while(s) { cnt+=(s&1); s>>=1; } return cnt; } int bit[30]; ll dfs(int pos,int s,bool f,bool z) { if(pos==-1) return Get(s)==k; if(!f && dp[pos][s][k] != -1) return dp[pos][s][k]; ll ans=0; int mm = f ? bit[pos] : 9; for(int i = 0;i <= mm;i ++) ans+=dfs(pos-1,z&&i==0?0:New(s,i),f&&i==mm,z&&i==0); if(!f) 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() { memset(dp,-1,sizeof(dp)); int t,T=1; scanf("%d",&t); while(t--) { ll n,m; scanf("%lld %lld",&n,&m); scanf("%d",&k); printf("Case #%d: ",T++); printf("%lld\n",solve(m)-solve(n-1)); } return 0; }
相关文章推荐
- 【Spring学习】IoC与DI
- SDWebImage下载图片
- Android 使用fastjson找不到fastjson包问题的解决方法
- 读写Excel -- ExcelToolUtil
- 带坑水题--第六届省赛A
- 单例模式
- 给img添加类名可以动态切换图片
- Android Studio导入jar包
- 由C++的泛型句柄类思考OpenCV的Ptr模板类
- Java泛型
- Ext JS 6开发实例(一)
- BOX2D 自然的旋转到一个指定角度
- 正则表达式
- BOX2D 自然的旋转到一个指定角度
- 重新加载tableView指定section的数据
- Jquery-animateNumber数字动画插件
- 【SSH网上商城项目实战22】获取银行图标以及支付页面的显示
- Solr理解Analyzers, Tokenizers, and Filters.
- iOS9 beta 请求出现App Transport Security has blocked a cleartext HTTP (http://)
- Redis相关命令