#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin() , x.end()
typedef long long ll;
const ll maxn = 1e5 + 16 , inf = 2e18;
ll a[maxn] , ps[maxn] , dp[maxn] , pd[maxn];
int opt[216][maxn];
ll cost(ll l , ll r){
ll res = ps[r] - (l ? ps[l - 1] : 0);
res *= res;
return res;
}
void dv(ll l , ll r , ll opl , ll opr , ll j){
if(l >= r) return;
ll m = (r + l) >> 1 , lm = min(m - 1 , opr);
dp[m] = inf;
ll ind = -1;
for(ll i = opl ; i <= lm ; i++){
ll h = pd[i] + cost(i + 1 , m);
if(h < dp[m]){
dp[m] = h;
ind = i;
}
}
opt[j][m] = ind;
dv(l , m , opl , ind , j); dv(m + 1 , r , ind , opr , j);
return;
}
vector<ll> v;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n , k;
cin>>n>>k;
for(ll i = 0 ; i < n ; i++){
cin>>a[i];
}
ps[0] = a[0];
for(ll i = 1 ; i < n ; i++){
ps[i] = ps[i - 1] + a[i];
}
for(ll i = 0 ; i < n ; i++){
pd[i] = ps[i] * ps[i];
}
for(ll j = 1 ; j <= k ; j++){
dv(j , n , j - 1 , n - 1 , j);
memcpy(pd , dp , sizeof(dp));
}
// for(ll i = 0 ; i < n ; i++){
// cout<<pd[i]<<' ';
// }
// cout<<'\n';
ll h = ps[n - 1] * ps[n - 1] - dp[n - 1]; h >>= 1ll;
cout<<h<<'\n';
ll p = n - 1 , j = k;
while(~j){
v.push_back(p);
p = opt[j--][p];
}
reverse(all(v));
for(ll i = 0 ; i < k ; i++){
cout<<v[i] + 1<<' ';
}
cout<<'\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
1236 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
1108 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
1236 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
9 ms |
2040 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
1748 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
7 ms |
2004 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
2132 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
1284 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
1236 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
4 ms |
1364 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1160 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
16 ms |
2772 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
2800 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
2516 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
2772 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
2724 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1492 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
1736 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1492 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
1492 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
63 ms |
9928 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
1492 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
74 ms |
6488 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
67 ms |
7372 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
57 ms |
7924 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
51 ms |
6644 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
67 ms |
7460 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
86 ms |
9168 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
4556 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
22 ms |
4604 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
669 ms |
82300 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
20 ms |
5204 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1298 ms |
81984 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
813 ms |
58456 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
605 ms |
62632 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
468 ms |
51552 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
616 ms |
58508 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
810 ms |
74140 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
