# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677128 | omikron123 | Rabbit Carrot (LMIO19_triusis) | C++14 | 27 ms | 3008 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<iostream>
#include <algorithm>
#include<vector>
using namespace std;
const int maxn = 200005;
int n,m;
vector<int> dp;
int main () {
scanf("%d%d",&n,&m);
dp.push_back(-m*n);
for(int i = 0; i < n; i++) {
int a;
scanf("%d",&a);
a += m*(n-i-1);
a *= -1;
vector<int>::iterator tmp = upper_bound(dp.begin(),dp.end(),a);
if(tmp != dp.begin()) {
if(tmp != dp.end()) *tmp = a;
else dp.push_back(a);
}
}
printf("%lu\n",n-dp.size()+1);
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... |