HDU 4352 XHXJ's LIS 数位dp+lis
2016-04-15 13:14
190 查看
B - XHXJ's LIS
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticeHDU
4352
Appoint description:
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
求[l,r]中lis为k的个数
数位dp利用了lis nlogn的求法
ACcode:
#include <map>
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define maxn 100
#define ll long long
using namespace std;
ll dp[25][1<<10][11];
int k;
int getnews(int x,int s){///找到第一个比x大的数替换它 nlogn求lis
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){///得到lis
int ret=0;
while(s){
if(s&1)ret++;
s>>=1;
}
return ret;
}
int bit[25];
ll dfs(int pos,int s,bool e,bool z){
if(pos==-1)return getnum(s)==k;
if(!e&&dp[pos][s][k]!=-1)return dp[pos][s][k];
ll ans=0;
int end=e?bit[pos]:9;
for(int i=0;i<=end;++i)
ans+=dfs(pos-1,(z&&i==0)?0:getnews(i,s),e&&i==end,z&&(i==0));
if(!e)dp[pos][s][k]=ans;
return ans;
}
ll calc(ll n){
int len=0;
while(n){
bit[len++]=n%10;
n/=10;
}
return dfs(len-1,0,1,1);
}
int main(){
int loop,cnt=1;
ll l,r;
memset(dp,-1,sizeof(dp));
scanf("%d",&loop);
while(loop--){
scanf("%I64d%I64d%d",&l,&r,&k);
printf("Case #%d: %I64d\n",cnt++,calc(r)-calc(l-1));
}
return 0;
}
/*
1
123 321 2
*/
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticeHDU
4352
Appoint description:
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
求[l,r]中lis为k的个数
数位dp利用了lis nlogn的求法
ACcode:
#include <map>
#include <queue>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define maxn 100
#define ll long long
using namespace std;
ll dp[25][1<<10][11];
int k;
int getnews(int x,int s){///找到第一个比x大的数替换它 nlogn求lis
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){///得到lis
int ret=0;
while(s){
if(s&1)ret++;
s>>=1;
}
return ret;
}
int bit[25];
ll dfs(int pos,int s,bool e,bool z){
if(pos==-1)return getnum(s)==k;
if(!e&&dp[pos][s][k]!=-1)return dp[pos][s][k];
ll ans=0;
int end=e?bit[pos]:9;
for(int i=0;i<=end;++i)
ans+=dfs(pos-1,(z&&i==0)?0:getnews(i,s),e&&i==end,z&&(i==0));
if(!e)dp[pos][s][k]=ans;
return ans;
}
ll calc(ll n){
int len=0;
while(n){
bit[len++]=n%10;
n/=10;
}
return dfs(len-1,0,1,1);
}
int main(){
int loop,cnt=1;
ll l,r;
memset(dp,-1,sizeof(dp));
scanf("%d",&loop);
while(loop--){
scanf("%I64d%I64d%d",&l,&r,&k);
printf("Case #%d: %I64d\n",cnt++,calc(r)-calc(l-1));
}
return 0;
}
/*
1
123 321 2
*/
相关文章推荐
- itext 实现pdf打印数字上标和下标
- epoll分析
- 拖延症“治疗”方案
- Android Fragment之间参数传递通过使用bundle进行参数传递
- linux升级OpenSSL
- 感悟:number 2
- 关于bugfree的配置问题
- java第五次作业
- yii2.0使用ActiveForm
- 进程通信之共享内存
- iOS开发 APP如何实现检测更新
- 程序员的最大挑战
- Android Fragment之间参数传递通过Activity中的变量
- Linux 下smi/mdio总线通信
- 实验5 数独游戏界面设计
- 手机web——自适应网页设计(html/css控制)
- Tomcat 安装配置
- 实验5 数独游戏界面设计
- Android中View和ViewGroup介绍
- 316. Remove Duplicate Letters