# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
906355 | 0xZero | Rabbit Carrot (LMIO19_triusis) | C++17 | 33 ms | 10964 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;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
ll m;
cin>>n>>m;
ll a[n*2]={0};
for(int i=n;i<2*n;i++){
cin>>a[i];
a[i]=m*(i-n+1)-a[i];
}
vector<ll> dp;
for(int i=0;i<2*n;i++){
int pos=upper_bound(dp.begin(), dp.end(), a[i])-dp.begin();
if(pos==dp.size())dp.push_back(a[i]);
else dp[pos]=a[i];
}
cout<<2*n-dp.size();
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... |