Codeforces 455A Boredom(dp 取还是不取)

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.

Examples
input
2
1 2
output
2
input
3
1 2 3
output
4
input
9
1 2 1 3 2 2 2 2 3
output
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.

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<cmath>
#include<cctype>
using namespace std;

#define PI acos(-1.0)
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int INF32M=0x3f3f3f3f;
const ll INF64M=0x3f3f3f3f3f3f3f3f;
int num[100005];
ll dp[100005];	//数值1-1e5范围 得分情况
//1e5 ..1e5 删两边 得1个1e5分 同理 求出值1e5个数 相同值序列 最多1e5个 1e10 ll 
int main()
{
	ios::sync_with_stdio(false);
	int n,t,m=0;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>t;
		num[t]++;
		m=max(m,t);	//求出最大值 考察1-max范围内得分 
	}
	dp[0]=0;
	dp[1]=1*num[1];	//i=1 不取1 取0 2上一个状态dp[0]=0 取1 不取i-1=0 i+1=2 i-2越界 
	//+1*num[1]得1分 1多少个 
	for(int i=2;i<=m;i++)
		dp[i]=max(dp[i-1],dp[i-2]+1ll*i*num[i]);	//不取 能取i-1 i+1延续上一个状态 
		//取i 删掉i-1 i+1 得分 得i分*i的个数 
	cout<<dp[m]<<endl;	//更新到最大值总得分
	 
	return 0;
}

涉及求和，dp会超int范围，故使用long long
1e5 1e5…1e5 删掉1e5一前一后 得1e5分 同理 最多n=1e5个
得 1e10