#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];
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]);
for (int i=0;i<=k-1;i++)
{
int l=1+i,r=n-(k-1-i);
if (get(l,r)==get(1,n))
{
res=min(res,get(l,r)+a[l-1]+a[n]-a[r]);
}
}
cout<<res;
}
Compilation message
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)
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2552 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2556 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2388 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2516 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2552 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 13 |
Incorrect |
1 ms |
2644 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2528 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 12 |
Incorrect |
1 ms |
2388 KB |
Output isn't correct |
| 13 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2552 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2556 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2388 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2516 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2552 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 13 |
Incorrect |
1 ms |
2644 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2552 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2556 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2388 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2516 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2552 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2388 KB |
Output is correct |
| 13 |
Incorrect |
1 ms |
2644 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
