제출 #1194087

#제출 시각아이디문제언어결과실행 시간메모리
1194087Hamed_GhaffariRabbit Carrot (LMIO19_triusis)C++20
100 / 100
16 ms1476 KiB
#include <bits/stdc++.h>
using namespace std;

int32_t main() {
    cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
    vector<int> dp;
    int n, m;
    cin >> n >> m;
    for(int i=1, x; i<=n; i++) {
        cin >> x;
        if(i*m-x>=0) {
            int pos = upper_bound(dp.begin(), dp.end(), i*m-x)-dp.begin();
            if(pos == dp.size()) dp.push_back(0);
            dp[pos] = i*m-x;
        }
    }
    cout << n - int(dp.size()) << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...