#include "bits/stdc++.h"
using namespace std;
#define int int64_t
#define pb push_back
const int lim=1e5+100;
const int mod=1e9+7;
using pii=pair<int,int>;
void solve(){
int n,k;
cin>>n>>k;
int a[n+1];
a[0]=0;
for(int i=1;i<=n;i++){
cin>>a[i];
a[i]+=a[i-1];
}
int dp[k+1][n+1];
memset(dp,0,sizeof(dp));
#define b(x) (dp[i-1][x]-a[x]*a[x])
for(int i=1;i<=k;i++){
deque<int>h;
h.pb(i);
for(int j=i+1;j<=n;j++){
int sz;
while(1<(sz=h.size())&&
b(h[sz-1])+a[j]*a[h[sz-1]]
<=
b(h[sz-2])+a[j]*a[h[sz-2]]
)h.pop_back();
dp[i][j]=b(h[sz-1])+a[j]*a[h[sz-1]];
while(1<h.size()&&
(b(j)-b(h[0]))*(a[h[0]]-a[h[1]])
>=
(b(h[1])-b(h[0]))*(a[h[0]]-a[j])
)h.pop_front();
h.push_front(j);
}
}
int ans=dp[k][n];
cout<<ans<<"\n";
int r=n;
for(int i=n-1;0<=i;i--){
if((a[r]-a[i])*a[i]+dp[k-1][i]==ans){
cout<<i<<" ";
ans-=(a[r]-a[i])*a[i];
r=i;
k--;
}
if(ans==0)break;
}
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
#ifdef Local
freopen(".in","r",stdin);
freopen(".out","w",stdout);
#endif
int t=1;
//cin>>t;
while (t--)
{
solve();
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
356 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
420 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
708 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
1884 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
1884 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
1628 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
1884 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
2140 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
604 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1104 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
1 ms |
860 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
55 ms |
16220 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
54 ms |
10076 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
45 ms |
11612 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
51 ms |
12424 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
50 ms |
10204 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
42 ms |
11584 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
51 ms |
14936 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
4700 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
20 ms |
4604 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Runtime error |
75 ms |
131072 KB |
Execution killed with signal 9 |
| 4 |
Halted |
0 ms |
0 KB |
- |
