제출 #1135901

#제출 시각아이디문제언어결과실행 시간메모리
1135901MateiKing80Rabbit Carrot (LMIO19_triusis)C++20
100 / 100
18 ms3520 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for(int &i : a)
        cin >> i;

    vector<int> b;
    for(int i = 1; i <= n; i ++)
        if(i * m >= a[i - 1])
            b.push_back(i * m - a[i - 1]);

    vector<int> ans;
    for(int i : b)
    {
        int idx = upper_bound(ans.begin(), ans.end(), i) - ans.begin();
        if(idx == ans.size())
            ans.push_back(i);
        else
            ans[idx] = i;
    }
    cout << n - ans.size();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...