This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int nx=1e5+5, kx=105;
int n, k, v[nx], dp[kx][nx];
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>k;
for (int i=1; i<=n; i++) cin>>v[i], dp[0][i]=1e9;
for (int i=1; i<=k; i++)
{
dp[i][0]=1e9;
for (int j=1; j<=n; j++)
{
dp[i][j]=1e9;
int mx=0;
for (int k=j; k>=1; k--)
{
mx=max(mx, v[k]);
dp[i][j]=min(dp[i][j], dp[i-1][k-1]+mx);
}
}
}
cout<<dp[k][n];
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |