# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696705 | Alihan_8 | Rabbit Carrot (LMIO19_triusis) | C++17 | 27 ms | 8392 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>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, M; cin >> n >> M;
vector <int> p(n);
for ( auto &i: p ) cin >> i;
vector <int> res;
for ( int i = 0; i < n; i++ ){
if ( (i+1)*M >= p[i] ) res.pb((i+1)*M-p[i]);
}
vector <int> dp;
for ( auto i: res ){
auto it = upper_bound(all(dp), i)-dp.begin();
if ( it == (int)dp.size() ) dp.pb(i);
else dp[it] = i;
}
cout << n-(int)dp.size();
cout << '\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... |