제출 #876056

#제출 시각아이디문제언어결과실행 시간메모리
876056tinnhiemnnRabbit Carrot (LMIO19_triusis)C++14
0 / 100
1 ms2396 KiB
#include <bits/stdc++.h> using namespace std; #define file "file" const long long N=2e5+5; long long n,M,i,j,res,b[N],f[N]; int main() { //freopen(file".inp", "r", stdin); //freopen(file".out", "w", stdout); ios_base::sync_with_stdio(); cin.tie(); cin>>n>>M; for (i=1;i<=n;i++) { cin>>j; b[i]=M*i-j; } f[0]=INT_MIN; for (i=1;i<=n;i++) { if (b[i]>=f[res]) {res++; f[res]=b[i]; continue;} j=upper_bound(f+1, f+res+1, b[i]) - f; f[j]=b[i]; } cout<<n-res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...