hdu 4352 XHXJ's LIS(LIS+数位DP,5级)
来源:互联网 发布:淘宝中年女秋季短皮靴 编辑:程序博客网 时间:2024/05/20 23:08
XHXJ's LIS
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 529 Accepted Submission(s): 219
Problem 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。
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<263-1 and 1<=K<=10).
0<L<=R<263-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
1123 321 2
Sample Output
Case #1: 139
Author
peterae86@UESTC03
Source
2012 Multi-University Training Contest 6
Recommend
zhuyuanchen520
思路:就是递增的LIS数位DP,真的弄懂了数位DP,其实就是多了个存的状态。也没增加多少难度。
坑:杭电long long 用%I64d 用lld WA
#include<cstdio>#include<cstring>#include<iostream>#define FOR(i,a,b) for(int i=a;i<=b;++i)#define clr(f,z) memset(f,z,sizeof(f))#define LL __int64#define ll(x) (1<<x)using namespace std;LL dp[40][ll(10)][11];//位数,1,0int bit[40],pos;LL L,R;int K;int numone(int state){ int ret=0; while(state) { ret+=state&1;state>>=1; } return ret;}int turn(int state,int x){ FOR(i,x,9) if(ll(i)&state) { return ((state^ll(i))|ll(x)); } return (state|ll(x));}LL DP(int pp,int state,bool nozero,bool big)//has 是否有inc==K{ if(pp==0)return numone(state)==K; if(big&&dp[pp][state][K]!=-1)return dp[pp][state][K]; LL ret=0; int kn=big?9:bit[pp]; FOR(i,0,kn) { ret+=DP(pp-1,(nozero||i!=0)?turn(state,i):0,nozero||i!=0,big||kn!=i); } if(big)dp[pp][state][K]=ret; return ret;}LL get(LL x){ pos=0; while(x) { bit[++pos]=x%10; x/=10; } return DP(pos,0,0,0);}int main(){ int cas;clr(dp,-1); while(~scanf("%d",&cas)) { FOR(ca,1,cas) { // cin>>L>>R>>K; scanf("%I64d%I64d%d",&L,&R,&K); printf("Case #%d: %I64d\n",ca,get(R)-get(L-1)); //cout<<get(R)-get(L-1)<<endl; } }}
- hdu 4352 XHXJ's LIS(LIS+数位DP,5级)
- 【HDU】4352 XHXJ's LIS 数位DP
- 【数位DP】【hdu 4352】XHXJ's LIS
- HDU 4352 XHXJ's LIS 数位dp
- HDU 4352 XHXJ's LIS(数位DP)
- hdu 4352 XHXJ's LIS(数位dp)
- HDU 4352 XHXJ's LIS【数位DP】
- 数位dp+LIS+状态压缩-hdu-4352-XHXJ's LIS
- HDU 4352 XHXJ's LIS 数位dp+lis
- hdu 4352 XHXJ's LIS --- 数位dp 状态压缩
- hdu 4352 XHXJ's LIS (数位dp)
- [数位dp+状态压缩] hdu 4352 XHXJ's LIS
- HDU 4352 XHXJ's LIS(数位DP)
- hdu 4352 - XHXJ's LIS (数位dp)多校联合
- HDU 4352 XHXJ's LIS (数位DP+状态压缩)
- HDU 4352 XHXJ's LIS 数位状压DP
- HDU 4352 XHXJ's LIS(数位dp&状态压缩)
- 【hdu】4352 XHXJ's LIS【状压+数位dp】
- Oracle学习笔记-0.获取安装软件
- android 登陆、注册、并个指定用户充值
- OpenCV通过Harr分类器人脸识别
- php学习入门
- mongodb 导入csv文件
- hdu 4352 XHXJ's LIS(LIS+数位DP,5级)
- ubuntu 系统下获取root权限
- JS使用正则去除字符串最后的逗号
- hdu 4322 (费用流,巧妙建图)
- 排序合集
- 程序员编程艺术 第一章笔记
- 1.Oracle10g安装
- android的 camera显示时,摄像头自动旋转90度的问题解决
- 2013年8月19日星期一(demo7_16,色彩旋转)