제출 #1228738

#제출 시각아이디문제언어결과실행 시간메모리
1228738anti36Rabbit Carrot (LMIO19_triusis)C++20
0 / 100
13 ms328 KiB
#include<bits/stdc++.h> using namespace std; int main() { long long n,m; cin>>n>>m; vector<long long>a(n); vector<long long>dp(n,0); long long res=0; for(long long i=0;i<n;i++) cin>>a[i]; for(long long i=0;i<n;i++) { if(abs(a[i]-0)<=m) dp[i]=1; for(long long j=0;j<i;j++) { if(abs(a[i]-a[j])<=m&&dp[j]>0) { dp[i]=max(dp[i],dp[j]+1); } } res=max(res,dp[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...