Address: http://codeforces.com/problemset/problem/455/A
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 + 1and 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.
Examples
2
1 2
2
3
1 2 3
4
9
1 2 1 3 2 2 2 2 3
10
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.
Topic meaning: delete ak, then all ak + 1 and ak-1 of this array are deleted, and get ak points at the same time. Find the maximum score you can get.
Parsing: Each number is bucket sorted num. In this way, there is no aftereffect for the following difference greater than 1. . From the 0 position to the right, then to eliminate a number i, if i-1 is eliminated, then i naturally does not exist, at this time dp [i] = dp [i-1], the score does not change, because i does not Had to be deleted. If i-1 is not deleted, then dp [i] = dp [i-2] + num [i] * i;
#include<iostream> #include<cstring> #include<cstdio> #include<algorithm> using namespace std; typedef long long ll; const int maxn=1e5+10; ll num[maxn]; ll dp[maxn]; int main() { ll n; cin>>n; int maxx=-1; int x; for(int i=1;i<=n;i++) { cin>>x; num[x]++; if(maxx<x) maxx=x; } dp[1]=num[1]; //初始dp[1] for(int i=1 ; i <= maxx; i++ ) { dp[i]=max(dp[i-1],dp[i-2]+num[i]*i); } cout<<dp[maxx]<<endl; }