제출 #796982

#제출 시각아이디문제언어결과실행 시간메모리
79698212345678Rabbit Carrot (LMIO19_triusis)C++17
63 / 100
1063 ms1732 KiB
#include <bits/stdc++.h> using namespace std; const int nx=3e5+5; int n, m, h[nx], c, dp[nx], ans; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>m; ans=n; for (int i=1; i<=n; i++) cin>>h[i], h[i]-=i*m; for (int i=1; i<=n; i++) { dp[i]=1e9; for (int j=0; j<i; j++) if (h[j]>=h[i]) dp[i]=min(dp[i], dp[j]+(i-j-1)); ans=min(ans, dp[i]+n-i); //cout<<i<<' '<<h[i]<<' '<<dp[i]<<' '<<ans<<'\n'; } 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...