제출 #1019400

#제출 시각아이디문제언어결과실행 시간메모리
1019400vjudge1Rabbit Carrot (LMIO19_triusis)C++14
100 / 100
67 ms2128 KiB
#include <bits/stdc++.h> using namespace std; int m,n; int a[200005]; int main() { cin >> n >> m; for(int i =1; i <= n; i++){ cin >> a[i]; } vector<int>dp(n+2,2e9+50); int lis=1; for(int i=0;i<=n+1;i++) { int pos=upper_bound(dp.begin(),dp.end(),-(a[i]-i*m))-dp.begin(); if(pos!=0 || i==0)dp[pos]=-(a[i]-i*m); lis=pos+1; } cout << n-(lis-2); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...