# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330093 | alien_lover | Rabbit Carrot (LMIO19_triusis) | C++14 | 1 ms | 384 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 <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
const int PRIME = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> alteredHeights(n);
for(int i = 0; i < n; i++){
int h;
cin >> h;
alteredHeights[i] = m * (i+1) - h;
}
vector<int> dp;
dp.push_back(INT32_MIN);
for(int i = 0; i < n; i++){
if(alteredHeights[i] < 0){
continue;
}
int ind = upper_bound(dp.begin(), dp.end(), alteredHeights[i]) - dp.begin();
if(ind == dp.size()){
dp.push_back(0);
}else{
dp[ind] = alteredHeights[i];
}
}
cout << n - dp.size() + 1 << '\n';
}
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... |