Submission #332774

#TimeUsernameProblemLanguageResultExecution timeMemory
332774nandonathanielK blocks (IZhO14_blocks)C++14
0 / 100
1 ms384 KiB
#include<bits/stdc++.h> using namespace std; const int MAXN=100005,MAXK=105; long long dp[MAXN][MAXK]; int a[MAXN]; int main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int N,K; cin >> N >> K; for(int i=1;i<=N;i++)cin >> a[i]; for(int i=1;i<=N;i++){ for(int j=1;j<=min(i,K);j++){ dp[i][j]=1e18; int maxi=a[i]; for(int k=i-1;k>=0;k--){ if(k>=j-1)dp[i][j]=min(dp[i][j],dp[k][j-1]+maxi); maxi=max(maxi,a[k]); } } } cout << dp[N][K] << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...