Submission #669474

#TimeUsernameProblemLanguageResultExecution timeMemory
669474smashRabbit Carrot (LMIO19_triusis)C++14
0 / 100
0 ms212 KiB
#include <bits/stdc++.h> #define int long long using namespace std; int n,m; int ans(vector<int>b) { vector<int>d; for(auto x:b) { int pos=upper_bound(d.begin(),d.end(),x)-d.begin(); int s=d.size(); if(pos==s) { d.push_back(x); } else { d[pos]=x; } } return d.size(); } int32_t main() { cin>>n>>m; vector<int>a(n); vector<int>b; for(int i=0; i<n; i++) { cin>>a[i]; } for(int i=0; i<n; i++) { if(m*(i+1)>a[i]) { b.push_back(m*(i+1)-a[i]); } } cout<<n-ans(b); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...