CodeForces 455A:Boredom (动态规划)
来源:互联网 发布:网络大电影 编辑:程序博客网 时间:2024/06/05 17:38
Boredom
Problem Description
Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.Given a sequence a consisting of n integers. The player can make several steps. In a single step he can choose an element of the sequence (let's denote it ak) and delete it, at that all elements equal to ak + 1 and ak - 1 also must be deleted from the sequence. That step brings ak points to the player.Alex is a perfectionist, so he decided to get as many points as possible. Help him.
Input
The first line contains integer n (1 ≤ n ≤ 105) that shows how many numbers are in Alex's sequence.The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 105).
Output
Print a single integer — the maximum number of points that Alex can earn.
Example
Note
Consider the third test example. At first step we need to choose any element equal to 2. After that step our sequence looks like this [2, 2, 2, 2]. Then we do 4 steps, on each step we choose any element equals to 2. In total we earn 10 points.
题意:
给出n个元素,让我们来挑选,如果选了
解题思路:
首先输入的时候用桶排序记录好。如果我们要选择其中一个元素才能获得最大价值,那么我们肯定要把与这个元素相等的都选了。所以选择一种元素的价值为 a[i]*i,接着就是dp了,用p记录前考虑i-1一个能获得的最大价值,q记录前i个能获得的最大价值,就有p=max(p,q);q=max(q,p+a[i]),当然右边的p和q都是上一层的。
Code:
#include <iostream>#include <string>#include <cstring>#include <algorithm>#include <cstdio>#define mem(a,b) memset(a,b,sizeof(a))using namespace std;typedef long long LL;const int maxn=1e5;LL a[maxn+5];int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++) { int num; scanf("%d",&num); a[num]++; } for(int i=1;i<=maxn;i++) a[i]=a[i]*i; LL p=0,q=0; for(int i=1;i<=maxn;i++) { //p代表不选第i个 LL temp=p; p=max(p,q); //q代表选第i个 if(temp+a[i]>q) q=temp+a[i]; } if(p>q) cout<<p<<endl; else cout<<q<<endl; return 0;}
阅读全文
0 0
- CodeForces 455A:Boredom (动态规划)
- codeforces 455A Boredom
- CodeForces 455A Boredom
- CodeForces 455A - Boredom
- CodeForces 455A Boredom
- Codeforces-455A-Boredom
- 【CodeForces 455A】Boredom(dp)
- codeforces 455A Boredom dp
- Codeforces 455A Boredom(高效)
- 【dp】 codeforces 455A Boredom
- Codeforces 455A Boredom (dp)
- CodeForces 455A Boredom (dp)
- Codeforces 455A Boredom【dp】
- codeforces Boredom 455A dp
- Codeforces Round #260 (Div. 1) 455 A. Boredom (DP)
- Codeforces Round #260 (Div. 2)455A - Boredom (DP)
- Codeforces Round #260 (Div. 1) 455 A. Boredom (DP)
- Codeforces #260 (Div. 2) C. Boredom(动态规划)
- 深入浅出JMS及ActiveMQ
- nginx启动脚本
- qt窗口坐标
- UWP(2) How to access the Sqlite db(如何访问Sqlite数据库文件)
- srpingBoot +mybatis 出现不能批量插入的问题,解决方法
- CodeForces 455A:Boredom (动态规划)
- iOS-未读消息的小红点展示
- C++对C语言的扩展(二)
- Redis发布与订阅以及日常存取源码分享
- CSS中可以和不可以继承的属性
- Linux 搭建redis
- spring boot 拦截器 注入dao 操作数据库时dao 为null
- Linux机器间同步文件脚本
- java学习初探2之语言基础(2)