#include<iostream>
#include<vector>
#include<algorithm>
typedef long long ll;
using namespace std;
ll S[111111];
ll D[2][111111];
int bt[202][111111];
int N, K;
int qu[111111];
int main() {
cin.sync_with_stdio(false);
cout.sync_with_stdio(false);
cin >> N >> K;
int i,j, k;
for (i = 1; i <= N; i++) {
cin >> S[i];
S[i] += S[i - 1];
}
for (k = 1; k <= K; k++) {
int s = 1, e = 0, kg = k % 2, a=0,b=0;
double gg=0,gg2=0;
for (i = 1; i <= N; i++) {
for (j = s; j <= e-1; j++) {
a = qu[j], b = qu[j+1];
if(S[a] == S[b])gg=0;
else gg=(double)(D[1-kg][b] - D[1-kg][a] - S[b] * S[b] + S[a] * S[a]) / (S[a]-S[b]);
if (gg <= S[i]) s++;
else break;
}
j = qu[s];
D[kg][i] = D[1-kg][j] + S[j] * (S[i] - S[j]);
bt[k][i] = j;
for (j = e; j > s; j--) {
a = qu[j], b = qu[j-1];
if(S[a] == S[b])gg=0;
else gg=(double)(D[1-kg][b] - D[1-kg][a] - S[b] * S[b] + S[a] * S[a]) / (S[a]-S[b]);
a = qu[j-1], b = i;
if(a == b)gg2=0;
else gg2=(double)(D[1-kg][b] - D[1-kg][a] - S[b] * S[b] + S[a] * S[a]) / (S[a]-S[b]);
if (gg >= gg2) {
e--;
}
else break;
}
qu[++e] = i;
}
}
ll ans = D[K%2][N];
cout << ans << endl;
k = K; i = N;
vector<int> btans;
while (bt[k][i] != 0) {
btans.push_back(bt[k][i]);
i = bt[k][i];
k--;
}
sort(btans.begin(), btans.end());
k = btans.size();
for (i = 0; i < k; i++) {
cout << btans[i] << " ";
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
4 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
3 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
78 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
0 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
56 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
65 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
86 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
63 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
70 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
73 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
25 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
834 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
24 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
975 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
671 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
846 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
613 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
615 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
796 ms |
92424 KB |
Output is correct - contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
