# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
911087 | KactusJack | Rabbit Carrot (LMIO19_triusis) | C++14 | 24 ms | 5908 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>
#define ll long long
#define F first
#define S second
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, m;
cin >> n >> m;
vector<ll> h(n+1);
for(ll i = 1; i <= n; i++){
cin >> h[i];
h[i] -= m * i;
h[i] *= -1;
}
vector<ll> dp;
for(int i = 1; i <= n; i++){
if(h[i] < 0){
continue;
}
int j = upper_bound(dp.begin(), dp.end(), h[i]) - dp.begin();
if(j == dp.size()){
dp.push_back(h[i]);
}
else{
dp[j] = h[i];
}
}
cout << n - dp.size() << "\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... |