제출 #815703

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
815703		AmrT	Rabbit Carrot (LMIO19_triusis)	C++14	63 / 100	1082 ms	3772 KiB

triusis

#include <bits/stdc++.h>
#define lop(i,a,b) for(ll i = a; i < b; i++)
#define alop(i,v) for(auto &i: v)
#define in(v) for(auto &i: v) cin >> i;
#define ll long long
#define endl '\n'
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(p, x) memset(p, x, sizeof(p))
using namespace std;
ll mod = 1e9 + 7;

int main(){
    ll n, m; cin >> n >> m;
    ll arr[n + 1] = {}, dp[n + 1] = {};
    lop(i, 0, n) cin >> arr[i + 1];
    
    ll ans = -1;
    for(int i = 1; i <= n; i++){
        dp[i] = (m * i) >= arr[i];
        for(int j = 1; j < i; j++){
            if(arr[j] + m * (i - j) >= arr[i] && dp[j]) dp[i] = max(dp[i], dp[j] + 1);
        }
        ans = max(ans, dp[i]);
    }
    
    cout << n - ans;

    return 0;
}

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