제출 #1247135

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247135		sunboi	Rabbit Carrot (LMIO19_triusis)	C++20	63 / 100	163 ms	327680 KiB

triusis

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main()
{
    int n, m; cin >> n >> m;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i];
    
    vector<vector<int>> dp(n + 1, vector<int> (n + 1, -1e18));
    dp[0][0] = 0;
    for (int i = 1; i <= n; i++){
        for (int j = 0; j <= i; j++){

            
            if (dp[i-1][j] != -1e18 && dp[i - 1][j] + m >= a[i]){
                dp[i][j] = max(dp[i][j], a[i]);
            }
            
            if (j != 0 && dp[i - 1][j - 1] != -1e18){
                dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + m);
            }
        }
    }
    for (int i = 0; i <= n; i++){
        if (dp[n][i] != -1e18){
            cout << i << endl;
            break;
        }
    }
}

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