# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1099263 | DangKhoizzzz | Rabbit Carrot (LMIO19_triusis) | C++14 | 22 ms | 8400 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 int long long
using namespace std;
const int maxn = 2e5 + 7;
int n , m , a[maxn] ;
void solve()
{
cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> a[i];
vector <int> b;
for(int i = 1; i <= n; i++)
{
if(a[i] <= m*i)
{
b.push_back(a[i] - m*i);
}
}
reverse(b.begin() , b.end());
vector <int> LIS;
for(int i = 0; i < b.size(); i++)
{
int j = upper_bound(LIS.begin() , LIS.end() , b[i]) - LIS.begin();
if(j == LIS.size())
{
LIS.push_back(b[i]);
}
else LIS[j] = b[i];
}
cout << n - LIS.size() << '\n';
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
solve();
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... |