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>
#define ll long long
#define str string
#define is insert
#define ed end()
#define fi first
#define se second
#define bg begin()
#define pb push_back
#define vll vector <ll>
#define mask(k) (1<<(k))
#define mll map <ll, ll>
#define pll pair <ll, ll>
#define ppl pair <ll, pll>
using namespace std;
ll n,k,i,j,pos,l,r,mid;
int f[4005][4005],p;
int a[400005];
int dp[4001][4001];
int b[4001][4001];
ll ans,m;
int get(ll l, ll r)
{
ll k=__lg(r-l+1);
return (b[l][k]+b[r-mask(k)+1][k]);
}
int main()
{
cin>>n>>m;
for (i=1; i<=n; i++)
{
cin>>a[i];
b[i][0]=a[i];
}
for (j=1; mask(j)<=n; j++)
for (i=1; i+mask(j)-1<=n; i++)
b[i][j]=(b[i][j-1]+b[i+mask(j-1)][j-1]);
memset(dp,0x3f,sizeof dp);
dp[0][0]=0;
for (i=1; i<=m; i++)
for (j=1; j<=n; j++)
{
for (k=1; k<=j; k++)
dp[i][j]=min(dp[i][j],dp[i-1][k-1]+get(k,j));
}
cout<<dp[m][n];
return 0;
}
# | 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... |