# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969563 | AliHasanli | K blocks (IZhO14_blocks) | C++17 | 1049 ms | 1372 KiB |
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;
int main()
{
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
//for(int i=0;i<n;i++)cout<<a[i]<<" ";cout<<endl;
int dp[k][n];
for(int i=0;i<k;i++)for(int j=0;j<n;j++)dp[i][j]=0;dp[0][0]=a[0];
//for(int i=0;i<k;i++)
//{
// for(int j=0;j<n;j++)cout<<dp[i][j]<<" ";cout<<endl;
//}
for(int i=1;i<n;i++)dp[0][i]=max(dp[0][i-1],a[i]);
//for(int i=0;i<n;i++)cout<<dp[0][i]<<" ";cout<<endl;
for(int i=1;i<k;i++)
for(int j=i;j<n;j++)
{
if(j==i)dp[i][j]=a[j]+dp[i-1][j-1];
else
{
int mak=0,ans=999999999;
for(int k=j;k>=i;k--)
{
mak=max(mak,a[k]);
ans=min(ans,dp[i-1][k-1]+mak);
}
dp[i][j]=ans;
}
}
//for(int i=0;i<k;i++)
//{
// for(int j=0;j<n;j++)cout<<dp[i][j]<<" ";cout<<endl;
//}
cout<<dp[k-1][n-1];
return 0;
}
Compilation message (stderr)
# | 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... |