| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 553395 | Blossomstream | Rabbit Carrot (LMIO19_triusis) | C++14 | 89 ms | 4164 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int n, m;
int a[200000];
vector<int> l;
int main() {
    cin >> n >> m;
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        a[i] -= (i + 1)*m;
        a[i] = -a[i];
    }
    l.push_back(0);
    for(int i = 0; i < n; i++) {
        int k = upper_bound(l.begin(), l.end(), a[i]) - l.begin();
        if(k < l.size() && a[i] >= 0) l[k] = a[i];
        else if(k == l.size()) l.push_back(a[i]);
    }
    cout << n - l.size() + 1 << endl;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
