제출 #946751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
946751		KK_1729	Rabbit Carrot (LMIO19_triusis)	C++17	63 / 100	1055 ms	5468 KiB

triusis

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

#define int long long
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define pb push_back
#define all(a) a.begin(), a.end()
#define endl "\n"

void printVector(vector<int> a){
    for (auto x: a) cout << x << " ";
    cout << endl;
}

int max(int x, int y){
    if (x > y) return x;
    else return y;
}


void solve(){
    int n, m; cin >> n >> m;
    vector<int> a(n+1);
    FOR(i,1,n+1) cin >> a[i];

    vector<int> b(n+1);
    FOR(i,1,n+1) b[i] = m*i-a[i];

    // printVector(b);
    vector<int> dp(n+1);
    int maxx = 0;
    FOR(i,1,n+1){
        if (b[i] >= 0){
            dp[i] = 1;
            FOR(j,1,i){
                if (b[j] >= 0 && b[j] <= b[i]) dp[i] = max(dp[i], 1+dp[j]);
            }
            maxx = max(maxx, dp[i]);
        }
    }
    
    cout << n-maxx << endl;
    // printVector(dp);
}
int32_t main(){
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", stdin)
    int t = 1; // cin >> t;
    while (t--) solve();
}

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