#include <stdio.h>
#define N 100000
double cross2(double x1, double y1, double x2, double y2) {
return x1 * y2 - x2 * y1;
}
long long xx[N + 1], yy[N + 1];
double cross(int i, int j, int k) {
return cross2(xx[j] - xx[i], yy[j] - yy[i], xx[k] - xx[i], yy[k] - yy[i]);
}
long long eval(int i, int x) {
return xx[i] * x + yy[i];
}
void solve(int *aa, long long *dp, int *kk, int n, long long c) {
static int qu[N + 1];
int i, head, cnt;
dp[0] = 0, xx[0] = aa[0], yy[0] = dp[0] - aa[0] * aa[0];
head = cnt = 0, qu[head + cnt++] = 0;
for (i = 1; i <= n; i++) {
while (cnt >= 2 && eval(qu[head], aa[i]) < eval(qu[head + 1], aa[i]))
head++, cnt--;
dp[i] = eval(qu[head], aa[i]) - c, kk[i] = kk[qu[head]] + 1;
xx[i] = aa[i], yy[i] = dp[i] - (long long) aa[i] * aa[i];
while (cnt >= 2 && cross(qu[head + cnt - 2], qu[head + cnt - 1], i) >= 0)
cnt--;
qu[head + cnt++] = i;
}
}
int main() {
static long long dp[N + 1], dq[N + 1];
static int aa[N + 1], kk[N + 1], ll[N + 1];
static char used[N];
int n, k, i, j;
long long lower, upper, x;
scanf("%d%d", &n, &k), k++;
for (i = 1; i <= n; i++) {
scanf("%d", &aa[i]);
aa[i] += aa[i - 1];
}
lower = -1, upper = 1000000000000000000;
while (upper - lower > 1) {
long long c = (lower + upper) / 2;
solve(aa, dp, kk, n, c);
if (kk[n] <= k)
upper = c;
else
lower = c;
}
solve(aa, dp, kk, n, upper);
solve(aa, dq, ll, n, upper - 1);
printf("%lld\n", dp[n] + upper * k);
for (i = n - 1, j = n, x = dp[j]; i >= 0; i--)
if (kk[i] <= k - 1 && k - 1 <= ll[i] && dp[i] + (long long) (aa[j] - aa[i]) * aa[i] - upper == x)
used[i] = 1, j = i, x = dp[j], k--;
for (i = 1; i < n; i++)
if (used[i])
printf("%d ", i);
printf("\n");
return 0;
}
Compilation message
sequence.c: In function 'main':
sequence.c:43:2: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
43 | scanf("%d%d", &n, &k), k++;
| ^~~~~~~~~~~~~~~~~~~~~
sequence.c:45:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]
45 | scanf("%d", &aa[i]);
| ^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
364 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
364 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
2 ms |
364 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
2 ms |
364 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
2 ms |
364 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
2 ms |
364 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
364 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
364 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
748 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
12 ms |
748 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
12 ms |
896 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
12 ms |
876 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
15 ms |
876 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
14 ms |
876 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
14 ms |
876 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
12 ms |
876 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
14 ms |
876 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
13 ms |
876 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
124 ms |
4844 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
129 ms |
5072 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
110 ms |
5612 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
109 ms |
5484 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
137 ms |
5228 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
144 ms |
5228 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
145 ms |
5612 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
125 ms |
5484 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
127 ms |
5356 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
127 ms |
5480 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
