题解 | 删除相邻数字的最大分数

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    const int MAXV = 10000; // ai ≤ 1e4
    vector<long long> sum(MAXV + 1, 0);
    for (int i = 0, x; i < n; ++i) {
        cin >> x;
        sum[x] += x; // 把相同值的得分累加
    }
    vector<long long> dp(MAXV + 1, 0);
    dp[1] = sum[1];
    for (int i = 2; i <= MAXV; ++i)
        dp[i] = max(dp[i - 1], dp[i - 2] + sum[i]);
    cout << dp[MAXV] << "\n";
    return 0;
}