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.
代码
#include <iostream>
using namespace std;
const int N=1e5+10;
long long dp[N][3];
long long m[N],ma=0;
int main ()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
long long a;
cin>>a;
m[a]++;
ma=max(ma,a);
}
for(int i=1;i<=ma;i++)
{
dp[i][0]=max(dp[i-1][0],max(dp[i-1][1],dp[i-1][2]));
dp[i][1]=max(dp[i-1][0],dp[i-1][2])+(long long)m[i]*i;
dp[i][2]=dp[i-1][1];
}
cout<<max(dp[ma][0],max(dp[ma][1],dp[ma][2]));
}