# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528447 | erto | Rabbit Carrot (LMIO19_triusis) | C++17 | 29 ms | 6468 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>
typedef long long int ll;
#define INF ll(1e9 + 7)
#define N (ll)1e5 + 5
using namespace std;
void solve(){
ll n, m, g, t, t2;
cin >> n >> m;
ll a[n], b[n+1];
for(int i=0 ;i<n; i++){
cin >> a[i];
b[i] = m*(i+1) - a[i];
}
vector<int> d;
for(int i=0; i<n; i++){
if(b[i] < 0)continue;
g = upper_bound(d.begin(), d.end(), b[i]) - d.begin();
if(g == d.size()){
d.push_back(b[i]);
}
else{
d[g] = b[i];
}
}
cout<<n - d.size();
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int T = 1;
//cin>>T;
while (T--){
solve();
}
}
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... |