codeforces #260 DIV 2 C题Boredom(DP)
来源:互联网 发布:传奇账号数据库 编辑:程序博客网 时间:2024/05/16 07:37
题目地址:http://codeforces.com/contest/456/problem/C
脑残了。。DP只DP到了n。。应该DP到10w+的。。
代码如下:
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <stdlib.h>#include <math.h>#include <ctype.h>#include <queue>#include <map>#include <set>#include <algorithm>using namespace std;__int64 a[110000], dp[110000];int main(){ __int64 n, x, i, j, max1=-1; scanf("%I64d",&n); memset(a,0,sizeof(a)); memset(dp,0,sizeof(dp)); for(i=0;i<n;i++) { scanf("%I64d",&x); a[x]++; } dp[0]=0; dp[1]=a[1]; dp[2]=a[2]*2; max1=max(dp[1],dp[2]); for(i=3;i<=100003;i++) { dp[i]=max(dp[i-2],dp[i-3])+a[i]*i; if(max1<dp[i]) max1=dp[i]; } printf("%I64d\n",max1); return 0;}
1 0
- codeforces #260 DIV 2 C题Boredom(DP)
- Boredom - CodeForces #260 (Div. 2) C dp
- Codeforces Round #260 (Div. 2)C. Boredom(dp)
- Codeforces Round #260 (Div. 2) C. Boredom(DP)
- Codeforces Round #260 (Div. 2) C. Boredom【DP】
- dp解Codeforces Round #260 (Div. 2)C. Boredom
- Codeforces Round #260 (Div. 2)455A - Boredom (DP)
- Codeforces Round #260 (Div. 2) C. Boredom
- Codeforces Round #260 (Div. 2) C Boredom
- Codeforces Round #260 (Div. 2)C. Boredom
- Codeforces Round #260 (Div. 1) 455 A. Boredom (DP)
- Codeforces Round #260 (Div. 1) 455 A. Boredom (DP)
- Codeforces #260 (Div. 2) C. Boredom(动态规划)
- Codeforces Round #260 (Div. 2)——C. Boredom
- CodeForces 456C - Boredom(DP)
- Codeforces 456C Boredom DP
- Codeforces Round #260 (Div. 1) A. Boredom
- Codeforces Round #260 (Div. 1) A. Boredom
- COCOS2DX中关于labelTTF控件获取不到触摸点的解决办法
- POJ 2288 Islands and Bridges(状态压缩)
- HDU 1398 Square Coins
- 设计模式-目录
- LeetCode_Minimun Path Sum
- codeforces #260 DIV 2 C题Boredom(DP)
- HDU-1754-I Hate It
- CF Round #260 (Div 2)
- ios 常见错误
- ios libxml/tree.h file not found解决办法
- HttpClient入门
- poj 1845(等比数列前n项和及快速幂)
- strace解决ssh登陆缓慢
- 个人整理使用的软件