제출 #1238557

#제출 시각아이디문제언어결과실행 시간메모리
1238557PokemonMasterRabbit Carrot (LMIO19_triusis)C++20
100 / 100
58 ms5048 KiB
#include<bits/stdc++.h> using namespace std; #define int long long const int inf=9e18; signed main() { int n,m; cin>>n>>m; vector <int> a(n+1); for(int i=1;i<=n;i++)cin>>a[i]; vector <int> b; for(int i=1;i<=n;i++) { if(a[i]-i*m<=0)b.push_back(i*m-a[i]); } //reverse(b.begin(),b.end()); vector <int> d(b.size()+1,inf); d[0]=-inf; for(int i=0;i<b.size();i++) { int ind=upper_bound(d.begin(),d.end(),b[i]) - d.begin(); d[ind]=b[i]; } int cnt=0; for(int i=1;i<d.size();i++) { if(d[i]-inf)cnt++; } cout<<n-cnt; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...