Submission #1330821

#TimeUsernameProblemLanguageResultExecution timeMemory
1330821AgageldiRabbit Carrot (LMIO19_triusis)C++20
100 / 100
19 ms3856 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define N 500005

const int inf = 1e9;

int n, a[N], m, ans, fn[N];
vector <long long> V;

int32_t main() {
    ios::sync_with_stdio(0);cin.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i] = (a[i] - i * m);
        if(a[i] <= 0) {
            a[i] *= -1;
            int lv = upper_bound(V.begin(),V.end(), a[i]) - V.begin();
            if(lv == (int)V.size()) V.push_back(a[i]);
            else V[lv] = a[i];
        }
    }
    cout << n - (int)V.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...