题目:
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.
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).
Print a single integer — the maximum number of points that Alex can earn.
2 1 2
2
3 1 2 3
4
9 1 2 1 3 2 2 2 2 3
10
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.
题意:
dp[i][0] = max(dp[i-1][0],dp[i-1][1]) ;
dp[i][1] = dp[i-1][0] + (long long)w[i]*i ;
代码:
#include<iostream>
#include<cstdio>
#include<queue>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
int a[1111111] ;
int w[1111111] ;
long long max(long long a,long long b)
{
return a>b?a:b;
}
long long dp[1111111][2] ;
int main()
{
int i ;
int n ;
scanf("%d",&n) ;
memset(w,0,sizeof(w)) ;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
w[a[i]]++ ;
}
//cout<<a[1]<<endl;
if(n==1)
{
cout<<a[1]<<endl;
return 0 ;
}
memset(dp,0,sizeof(dp)) ;
dp[1][0] = 0 ;
dp[1][1] = w[1] ;
for(i=2;i<=100011;i++)
{
dp[i][0] = max(dp[i-1][0],dp[i-1][1]) ;
dp[i][1] = dp[i-1][0] + (long long)w[i]*i ;
}
cout<<max(dp[100011][0],dp[100011][1])<<endl;
return 0 ;
}