Submission #799556

#	Time	Username	Problem	Language	Result	Execution time	Memory
799556		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	35 / 100	115 ms	196436 KiB

triusis

#include <iostream>
#include <cstring>
using namespace std;
int a[5005], f[5005][5005], g[5005][5005];
int main() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    memset(f, 0x3f, sizeof f);
    memset(g, 0x3f, sizeof g);
    int mi = 999999999;
    f[0][0] = g[0][0] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 5000; j >= 0; j--) {
            f[i][j] = g[i - 1][max(0, j - m)];
            if (j != a[i]) f[i][j]++;
            g[i][j] = min(g[i][j + 1], f[i][j]);
        }
    }
    for (int i = 5000; i >= 0; i--) mi = min(mi, f[n][i]);
    cout << mi;
}

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37