codeforces 1110D - Jongmah GNU

[i-2,i-1,i],[i-1,i,i+1],[i,i+1,i+2] 对于i+1状态[i-1,i,i+1]可以由i状态求的古不考虑

dp[i][j][k] 用掉j+k个i+1故减去

$$dp[i+1][k][t]=max(dp[i+1][k][t],dp[i][j][k]+(cnt[i+1]-j-k-t)/3+t);$$

#include<bits/stdc++.h>
using namespace std;
#define fst first
#define sec second
#define sci(num) scanf("%d",&num)
#define scl(num) scanf("%lld",&num)
#define mem(a,b) memset(a,b,sizeof a)
#define cpy(a,b) memcopy(a,b,sizeof b)
typedef long long LL;
typedef pair<int,int> P;
const int MAX_N = 1e6 + 100;
int cnt[MAX_N];
int dp[MAX_N][3][3];
int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int N,M;
    cin >> N >> M;
    for (int i = 1;i <= N;i++) {
        int num;
        cin >> num;
        cnt[num]++;
    }
    mem(dp,-1);
    dp[0][0][0] = 0;
    for (int i = 0;i <= M;i++) {
        for (int j = 0;j < 3;j++) {
            for (int k = 0;k < 3;k++) {
                if (dp[i][j][k] < 0) continue;
                int now = cnt[i+1] - j - k;
                for (int t = 0;t < 3 && t <= now;t++) {
                    dp[i+1][k][t] = max(dp[i+1][k][t],dp[i][j][k] + (now-t) / 3 + t);
                }
            }
        }
    }
    cout << dp[M+1][0][0];
    return 0;
}