Codeforces Round #286 C. Mr. Kitayuta, the Treasure Hunter dp
来源:互联网 发布:五十知天命 出自哪 编辑:程序博客网 时间:2024/04/29 21:21
The Shuseki Islands are an archipelago of 30001 small islands in the Yutampo Sea. The islands are evenly spaced along a line, numbered from 0 to 30000 from the west to the east. These islands are known to contain many treasures. There are n gems in the Shuseki Islands in total, and the i-th gem is located on island pi.
Mr. Kitayuta has just arrived at island 0. With his great jumping ability, he will repeatedly perform jumps between islands to the east according to the following process:
- First, he will jump from island 0 to island d.
- After that, he will continue jumping according to the following rule. Let l be the length of the previous jump, that is, if his previous jump was from island prev to island cur, let l = cur - prev. He will perform a jump of length l - 1, l or l + 1 to the east. That is, he will jump to island (cur + l - 1), (cur + l) or (cur + l + 1) (if they exist). The length of a jump must be positive, that is, he cannot perform a jump of length 0 when l = 1. If there is no valid destination, he will stop jumping.
Mr. Kitayuta will collect the gems on the islands visited during the process. Find the maximum number of gems that he can collect.
The first line of the input contains two space-separated integers n and d (1 ≤ n, d ≤ 30000), denoting the number of the gems in the Shuseki Islands and the length of the Mr. Kitayuta's first jump, respectively.
The next n lines describe the location of the gems. The i-th of them (1 ≤ i ≤ n) contains a integer pi (d ≤ p1 ≤ p2 ≤ ... ≤ pn ≤ 30000), denoting the number of the island that contains the i-th gem.
Print the maximum number of gems that Mr. Kitayuta can collect.
4 1010212727
3
8 8919283645556678
6
13 788916171718212324242630
4
In the first sample, the optimal route is 0 → 10 (+1 gem) → 19 → 27 (+2 gems) → ...
In the second sample, the optimal route is 0 → 8 → 15 → 21 → 28 (+1 gem) → 36 (+1 gem) → 45 (+1 gem) → 55 (+1 gem) → 66 (+1 gem) → 78 (+1 gem) → ...
In the third sample, the optimal route is 0 → 7 → 13 → 18 (+1 gem) → 24 (+2 gems) → 30 (+1 gem) → ...
//93 ms 59700 KB#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int dp[30007][507],trea[30007];int main(){ int n,k; while(scanf("%d%d",&n,&k)!=EOF) { int a; memset(dp,-1,sizeof(dp)); memset(trea,0,sizeof(trea)); for(int i=0; i<n; i++) { scanf("%d",&a); trea[a]++; } dp[k][250]=trea[k]; int ans=dp[k][250]; for(int i=k; i<=30000; i++) for(int j=1; j<=500; j++) { if(dp[i][j]==-1)continue; int to=i+k+j-250; if(to<=30000) { dp[to][j]=max(dp[to][j],dp[i][j]+trea[to]); ans=max(ans,dp[to][j]); } if(to+1<=30000) { dp[to+1][j+1]=max(dp[to+1][j+1],dp[i][j]+trea[to+1]); ans=max(ans,dp[to+1][j+1]); } if(to-i>1&&to<=30000) { dp[to-1][j-1]=max(dp[to-1][j-1],dp[i][j]+trea[to-1]); ans=max(ans,dp[to-1][j-1]); } } printf("%d\n",ans); } return 0;}
- Codeforces Round #286 C. Mr. Kitayuta, the Treasure Hunter dp
- 【DP】 Codeforces Round #286 A - Mr. Kitayuta, the Treasure Hunter
- Codeforces Round #286 (Div. 2) C. Mr. Kitayuta, the Treasure Hunter——dp
- Codeforces Round #286 (Div. 2) C. Mr. Kitayuta, the Treasure Hunter+dp+优化
- Codeforces Round #286 (Div. 2) C Mr. Kitayuta, the Treasure Hunter ( DP )
- Codeforces Round #286 (Div. 2) C. Mr. Kitayuta, the Treasure Hunter(经典的DP)
- Codeforces Round #286 (Div. 2) C. Mr. Kitayuta, the Treasure Hunter dp+范围压缩
- Codeforces Round #286 (Div. 2) C. Mr. Kitayuta, the Treasure Hunter dp
- codeforces 505C C. Mr. Kitayuta, the Treasure Hunter (dp)
- codeforces 505C Mr. Kitayuta, the Treasure Hunter(dp)
- codeforces 505C Mr. Kitayuta, the Treasure Hunter(DP)
- codeforces 505C Mr. Kitayuta, the Treasure Hunter(DP)
- [Codeforces Round #286 DIV1A (CF506A)] Mr. Kitayuta, the Treasure Hunter
- Codeforces Round #286 (Div. 2) C题 Mr. Kitayuta, the Treasure Hunter (DFS+记忆化DP)
- Codeforces Round #286 (Div. 2) C. Mr. Kitayuta, the Treasure Hunter
- Codeforces Round #286 (Div. 2)C. Mr. Kitayuta, the Treasure Hunter
- CodeForces 505C Mr. Kitayuta, the Treasure Hunter
- CodeForces-505C Mr. Kitayuta, the Treasure Hunter
- 指法练习步骤及目标要求
- ListView具有多种item布局——实现微信对话列
- Oracle OCP认证考试题库解析052-3
- 什么是系统进程?
- Dos BAT 找到目录下的某文件名放到变量里去
- Codeforces Round #286 C. Mr. Kitayuta, the Treasure Hunter dp
- C语言中的static 详细分析
- 解决eclipse打开出现Failed to create the java virtual machine
- 未能加载文件或程序集“MagickNet”或它的某一个依赖项。试图加载格式不正确的程序
- hudson解决svn中文路径问题
- Oracle OCP认证考试题库解析052-4
- 百度图像搜索探秘
- zip文件用什么打开,如何打开zip文件
- java序列化作用