| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 744652 | vjudge1 | Rabbit Carrot (LMIO19_triusis) | C++17 | 43 ms | 5328 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;
#define int long long
const int inf = 1e9;
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int m, n;
cin >> n >> m;
vector<int> v;
for(int i=0; i<n; i++){
int a; cin >> a;
if(m*(i+1) >=a ) v.push_back(m*(i+1) - a);
}
vector<int> lis;
for(int i=0; i<v.size(); i++){
int id = upper_bound(lis.begin(), lis.end(), v[i]) - lis.begin();
if(id == lis.size()){
lis.push_back(v[i]);
}
else lis[id] = v[i];
}
cout << n - lis.size() << endl;
return 0;
}
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... | ||||
