# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
369344 | BeanZ | Rabbit Carrot (LMIO19_triusis) | C++14 | 34 ms | 5356 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.
// I_Love_LPL
// 1
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 2e5 + 5;
long long mod = 1e9 + 7;
const int lim = 700;
const int lg = 19;
const long double eps = 1e-6;
ll a[N], b[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("tests.inp", "r")){
freopen("test.inp", "r", stdin);
freopen("test.ans", "w", stdout);
}
ll n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++){
cin >> a[i];
a[i] -= i * m;
}
ll sz = 0;
for (int i = 1; i <= n; i++){
if (a[i] > 0) continue;
ll l = 1, h = sz;
while (l <= h){
ll mid = (l + h) >> 1;
if (b[mid] >= a[i]) l = mid + 1;
else h = mid - 1;
}
if (l > sz){
sz++;
}
b[l] = a[i];
}
cout << n - sz;
}
/*
Ans:
Out:
*/
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... |