제출 #1289666

#제출 시각아이디문제언어결과실행 시간메모리
1289666hahaStove (JOI18_stove)C++20
50 / 100
195 ms98764 KiB
#include <bits/stdc++.h> #define f first #define s second #define ll long long using namespace std; const int maxn=5e3+5; int n,k; int a[maxn]; int dp[maxn][maxn],Min[maxn]; int main() { ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); cin>>n>>k; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=0;i<=n;i++){ for(int j=0;j<=k;j++) dp[i][j]=1e9; } dp[0][0]=0; for(int j=1;j<=k;j++){ Min[0]=dp[0][j-1]; for(int i=1;i<=n;i++){ Min[i]=min(Min[i-1],dp[i-1][j-1]-a[i]); } for(int i=1;i<=n;i++){ dp[i][j]=min(dp[i][j],Min[i]+a[i]+1); } } cout<<dp[n][k]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...