# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797678 | GoldLight | Rabbit Carrot (LMIO19_triusis) | C++17 | 23 ms | 4156 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;
void fast(){ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
int main(){
fast();
int n, m; cin>>n>>m;
int a[n+1]; a[0]=0;
for(int i=1; i<=n; i++){
cin>>a[i];
a[i]=m*i-a[i];
}
vector<int> v;
for(int i=1; i<=n; i++){
if(a[i]<0) continue;
int idx=upper_bound(v.begin(), v.end(), a[i])-v.begin();
if(idx==v.size()) v.push_back(a[i]);
else v[idx]=a[i];
}
cout<<n-v.size();
}
/*
const int N=1e5;
vector<int> v[N+1];
int lv[N+1];
int main(){
fast();
int n; cin>>n;
for(int i=1; i<n; i++){
int x, y; cin>>x>>y;
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... |