【链接】点击打开链接

【题意】

【题解】

【反思】

【代码】

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <cstdlib>
#include <cmath>
#include <bitset>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define mp make_pair
#define pb emplace_back
#define fi first
#define se second
#define ld long double
#define ms(x,y) memset(x,y,sizeof x)
#define ri(x) scanf("%d",&x)
#define rl(x) scanf("%lld",&x)
#define rs(x) scanf("%s",x)
#define rf(x) scnaf("%lf",&x)
#define oi(x) printf("%d",x)
#define ol(x) printf("%lld",x)
#define oc putchar(' ')
#define os(x) printf(x)
#define all(x) x.begin(),x.end()
#define Open() freopen("F:\\rush.txt","r",stdin)
#define Close() ios::sync_with_stdio(0)
#define sz(x) ((int) x.size())
#define ld long doubletypedef pair<int, int> pii;
typedef pair<LL, LL> pll;//mt19937 myrand(time(0));
//int get_rand(int n){return myrand()%n + 1;}
const int dx[9] = { 0,1,-1,0,0,-1,-1,1,1 };
const int dy[9] = { 0,0,0,-1,1,-1,1,-1,1 };
const double pi = acos(-1.0);
const int N = 500;
const int INF = 1000;
const int MA = 0x3f3f3f3f;int n, k, b[N + 10],dp[INF+10][2][INF+10];
int a[INF + 10];int main() {//Open();//Close();while (~ri(n)) {ri(k);rep1(i, 1, n) ri(b[i]);sort(b + 1, b + 1 + n);int pos = 0;rep1(i, 1, n) {int j = i;while (j + 1 <= n && b[j + 1] == b[i]) j++;if (i > 1 && b[i] != b[i - 1] + 1) {pos++;a[pos] = 0;}a[++pos] = j - i + 1;i = j;}n = pos;ms(dp, -1);dp[1][0][0] = 0, dp[1][1][1] = a[1];k = min(k, n);rep1(i,1,n-1)rep1(j,0,k) {if (dp[i][0][j] >= 0) {//没放dp[i + 1][1][j + 1] = max(dp[i + 1][1][j + 1], dp[i][0][j] + a[i+1]);//i+1选dp[i + 1][0][j] = max(dp[i + 1][0][j], dp[i][0][j]);//i+1不选}if (dp[i][1][j] >= 0) {//选了//i+1不能选dp[i + 1][0][j] = max(dp[i + 1][0][j], dp[i][1][j]);}}int ans = 0;rep1(p, 0, 1)rep1(i, 0, k)ans = max(ans, dp[n][p][i]);oi(ans); puts("");}return 0;
}