# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
880783 | votranngocvy | Rabbit Carrot (LMIO19_triusis) | C++14 | 47 ms | 5200 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 pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
const int N = 2e5 + 5;
vector<int>a;
int bit[N];
void compress() {
vector<pii>vec;
for (int i = 0; i < a.size(); i++) vec.push_back(mp(a[i],i));
sort(vec.begin(),vec.end());
a[vec[0].se] = 1;
for (int i = 1; i < vec.size(); i++)
if (vec[i].fi == vec[i - 1].fi) a[vec[i].se] = a[vec[i - 1].se];
else a[vec[i].se] = i + 1;
}
void update(int i,int x) {
for (; i < N; i += i & (-i)) bit[i] = max(bit[i],x);
}
int get(int i) {
int ans = 0;
for (; i > 0; i -= i & (-i)) ans = max(ans,bit[i]);
return ans;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n,m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (m * i - x >= 0) a.push_back(m * i - x);
}
int ans = 0;
if (a.size()) {
compress();
for (int i = 0; i < a.size(); i++) {
int tmp = get(a[i]) + 1;
ans = max(ans,tmp);
update(a[i],tmp);
}
}
cout << n - ans << "\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... |