제출 #1178967

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

triusis

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

int main(){
    int n,m;
    cin >> n >> m;
    vector<int> a(n);
    for(int i=0;i<n;i++)cin >> a[i];
    vector<vector<int>> dp(n+1,vector<int>(n+1,-1));
    for(int i=0;i<=n;i++){
        dp[0][i]=0;
    }
    for(int i=1;i<=n;i++){
        for(int j=0;j<=n;j++){
            if(j!=0)dp[i][j]=dp[i][j-1];
            if(j!=0 and dp[i-1][j-1]!=-1)dp[i][j]=max(dp[i][j],dp[i-1][j-1]+m);
            if(dp[i-1][j]+m>=a[i-1] and dp[i-1][j]!=-1)dp[i][j]=max(dp[i][j],a[i-1]);
            if(i==n and dp[i][j]!=-1){
                cout << j << "\n";
                return 0;
            }
        }
    }
}

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