| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 783599 | vjudge1 | Rabbit Carrot (LMIO19_triusis) | C++17 | 25 ms | 5260 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, arr[200005];
vector<int> dp, v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i=0; i<n; i++){
cin >> arr[i];
if(arr[i]<=(i+1)*m) v.push_back((i+1)*m-arr[i]);
}
for(auto a:v){
auto it=upper_bound(dp.begin(), dp.end(), a)-dp.begin();
if(it==dp.size()){
dp.push_back(a);
}else{
dp[it]=a;
}
}
cout << n-dp.size() << 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... | ||||
