#include <iostream>
using namespace std;
const int N = 1e3 + 5;
int m, n, sum, len, last, f[N][3], a[N];
struct node
{
    int num, w;
} e[N];
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    int last = a[1], sum = 1;
    for (int i = 2; i <= n; i++)
    {
        if (last == a[i])
            sum++;
        else
            last = a[i], e[++len] = {a[i - 1], sum}, sum = 1;
    }
    e[++len] = {a[n], sum};
    for (int i = 1; i <= len; i++)
        for (int j = m; j >= 0; j--)
        {
            if (e[i].num == 1)
            {
                f[j][1] += e[i].w;
                if (j >= 1)
                    f[j][2] = max(f[j][2], f[j - 1][1] + e[i].w);
            }
            else
            {
                f[j][2] += e[i].w;
                if (j >= 1)
                    f[j][1] = max(f[j][1], f[j - 1][2] + e[i].w);
            }
        }
    cout << max(f[m][1], f[m][2]) << endl;
}

基于背包思想的状态机DP，得了86分，只有第五个点，输出min才正确，但是别的点输出min是肯定错的。不知道错哪里了，求调