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;
#define mask(i) (1<<i)
const int N=1e5;
int n,k,res=1e9;
int a[N+2],mx[N+2][21],dp[N+2][102];
int get(int l,int r)
{
int k=__lg(r-l+1);
return max(mx[l][k],mx[r-mask(k)+1][k]);
}
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],mx[i][0]=a[i],a[i]+=a[i-1];
for (int j=1;mask(j)<=n;j++)
for (int i=1;i+mask(j)-1<=n;i++)
mx[i][j]=max(mx[i][j-1],mx[i+mask(j-1)][j-1]);
memset(dp,0x3f,sizeof dp);
dp[0][0]=0;
for (int j=1;j<=k;j++)
for (int i=j;i<=n;i++)
{
for (int p=j;p<=min(j+40,i);p++) dp[i][j]=min(dp[i][j],dp[p-1][j-1]+get(p,i));
}
cout<<dp[n][k];
}
Compilation message (stderr)
blocks.cpp: In function 'int main()':
blocks.cpp:20:38: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
20 | mx[i][j]=max(mx[i][j-1],mx[i+mask(j-1)][j-1]);
| ~^~
blocks.cpp:3:21: note: in definition of macro 'mask'
3 | #define mask(i) (1<<i)
| ^
# | 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... |