제출 #1174450

#제출 시각아이디문제언어결과실행 시간메모리
1174450ezzzayRabbit Carrot (LMIO19_triusis)C++20
63 / 100
34 ms500 KiB
#include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back #define int long long const int N=5005; vector<int>ans; int a[N]; int dp[N]; signed main(){ int n,x; cin>>n>>x; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<=n;i++)dp[i]=1e9; dp[0]=0; int ans=n; for(int i=1;i<=n;i++){ for(int j=0;j<i;j++){ if(a[i]-a[j] <=(i-j)*x){ dp[i]=min(dp[i],dp[j]+i-j-1); } } ans=min(ans,n-i+dp[i]); } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...