제출 #970250

#제출 시각아이디문제언어결과실행 시간메모리
970250vjudge1Rabbit Carrot (LMIO19_triusis)C++17
100 / 100
61 ms5064 KiB
#include<bits/stdc++.h> using namespace std; int main() { int m,n,a[200001],b[200001]; cin>>n>>m; for(int i=1;i<=n;++i) { cin>>a[i]; b[i] = -(a[i] - m*i); } a[0] = 0; b[0] = 0; vector<int> v; for(int i=1;i<=n;++i) { if(b[i]<0) continue; else { auto it = upper_bound(v.begin(),v.end(),b[i]); if(v.empty() || it==v.end()) v.push_back(b[i]); else { *it = b[i]; } } } cout<<n-v.size(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...