# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797263 | dimasnbayu | Rabbit Carrot (LMIO19_triusis) | C++14 | 22 ms | 3028 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 start cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
#define endl '\n'
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fflush(stdout); cout.flush();
/*********************************/
/*********************************/
int a[200005], b[200005];
int main(){
start
int n, m; cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
b[i]=(m*i)-a[i];
}
vector<int>v;
for(int i=1;i<=n;i++){
int x=b[i];
if(x<0) continue;
int idx=upper_bound(v.begin(), v.end(), x) - v.begin();
if(idx==v.size()) v.push_back(x);
else v[idx]=x;
}
int komp=v.size();
cout<<n-komp<<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... |