#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int maxn = 1e5 + 20;
const int maxk = 2e2 + 20;
ll dp[maxn] , pd[maxn];
int par[maxn][maxk] , ind , sum[maxn];
inline ll get(int i , int j)
{
if(i <= j)
return 1e18;
return 1LL * (sum[i] - sum[j]) * (sum[i] - sum[j]) + pd[j];
}
inline void solve(int l , int r , int L , int R)
{
if(l > r)
return;
int m = (l + r) / 2 , pt = L;
ll mn = 1e18;
for(int i = L; i <= R && i < m; i++)
if(mn >= get(m , i))
{
mn = get(m , i);
pt = i;
}
par[m][ind] = pt;
dp[m] = get(m , pt);
solve(l , m - 1 , L , pt);
solve(m + 1 , r , pt , R);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n , k;
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> sum[i] , sum[i] += sum[i - 1];
for(int i = 1; i <= n; i++)
pd[i] = 1e18;
for(int i = 1; i <= k + 1; i++)
{
ind = i;
solve(0 , n , 0 , n);
for(int i = 0; i <= n; i++)
pd[i] = dp[i];
}
cout << (1LL * sum[n] * sum[n] - dp[n]) / 2 << endl;
int A = n;
vector<int> ans;
for(int i = k + 1; i > 1; i--)
{
ans.pb(par[A][i]);
A = par[A][i];
}
reverse(ans.begin() , ans.end());
for(auto x : ans)
cout << x << " ";
cout << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
2 ms |
556 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
2 ms |
556 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
2 ms |
556 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
2 ms |
556 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
2 ms |
556 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
2 ms |
556 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
2 ms |
556 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
2 ms |
580 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
2 ms |
596 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
2 ms |
596 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
764 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
2 ms |
764 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
3 ms |
764 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
2 ms |
764 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
3 ms |
764 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
3 ms |
764 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
3 ms |
764 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
3 ms |
764 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
2 ms |
764 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
3 ms |
764 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1532 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
2 ms |
1532 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
8 ms |
1532 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
3 ms |
1532 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
9 ms |
1532 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
8 ms |
1532 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
9 ms |
1532 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
8 ms |
1536 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
4 ms |
1536 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
5 ms |
1536 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
9468 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
10 ms |
9468 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
89 ms |
9476 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
11 ms |
9476 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
70 ms |
9476 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
84 ms |
9476 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
87 ms |
9476 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
65 ms |
9476 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
71 ms |
9476 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
99 ms |
9476 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
107 ms |
88584 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
116 ms |
88756 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
1157 ms |
88756 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
111 ms |
88756 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1700 ms |
88956 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
1247 ms |
88956 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
1324 ms |
88956 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
1018 ms |
88956 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
1061 ms |
88956 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
1382 ms |
88956 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |