제출 #796966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
796966		12345678	Rabbit Carrot (LMIO19_triusis)	C++17	35 / 100	111 ms	98488 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

const int nx=5e3+5;
int n, m, a[nx], dp[nx][nx], ans=1e9;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>a[i];
    for (int i=1; i<nx; i++) dp[0][i]=nx;
    for (int i=1; i<=n; i++)
    {
        int mn=1e9;
        vector<int> v(nx);
        for (int j=nx-1; j>=0; j--) mn=min(mn, dp[i-1][j]), v[j]=mn;
        for (int j=0; j<nx; j++) dp[i][j]=v[max(0, j-m)]+1;
        for (int j=max(0, a[i]-m); j<nx; j++) dp[i][a[i]]=min(dp[i][a[i]], dp[i-1][j]);
    }
    for (int i=0; i<nx; i++) ans=min(ans, dp[n][i]);
    cout<<ans;
}

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