/* Bismillahir Rahmanir Rahim */
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int K = 205;
long long M[N], B[N], I[N];
int idx, ptr;
bool bad(int a, int b, int c){
return (B[a] - B[b]) * (M[c] - M[a]) >= (B[a] - B[c]) * (M[b] - M[a]);
}
void add(long long m, long long b, int i){
++idx;
M[idx] = m;
B[idx] = b;
I[idx] = i;
while(idx >= 3 && bad(idx-2, idx-1, idx)){
M[idx-1] = M[idx];
B[idx-1] = B[idx];
I[idx-1] = I[idx];
idx--;
}
}
inline long long query(long long x){
if(ptr > idx) ptr = idx;
while(ptr + 1 <= idx && M[ptr+1] * x + B[ptr+1] > M[ptr] * x + B[ptr]){
++ptr;
}
return M[ptr] * x + B[ptr];
}
long long A[N], sum[N], cur[N], past[N];
int nxt[N][K];
int n, k;
int marked[N];
int main(){
scanf("%d %d", &n, &k);
for(int i=1;i<=n;i++){
scanf("%lld", &A[i]);
sum[i] = sum[i-1] + A[i];
}
for(int j=1;j<=k;j++){
idx = 0, ptr = 0;
add(sum[1], -(sum[1] * sum[1]), 1);
for(int i=2;i<=n;i++){
cur[i] = query(sum[i]);
nxt[i][j] = I[ptr];
add(sum[i], -(sum[i] * sum[i]) + past[i], i);
}
for(int i=1;i<=n;i++) past[i] = cur[i];
}
cout << cur[n] << endl;
int cr = n, lf = k;
while(lf){
cr = nxt[cr][lf];
marked[cr] = 1;
lf -= 1;
}
int left = k;
for(int i=1;i<=n;i++) left -= marked[i];
for(int i=1;i<=n;i++){
if(!marked[i] && left) marked[i] = 1, left--;
if(marked[i]) printf("%d ", i);
}
cout << endl;
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:44:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &k);
^
sequence.cpp:46:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", &A[i]);
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Incorrect |
0 ms |
87960 KB |
contestant didn't find the optimal answer: 0 < 1 |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Incorrect |
0 ms |
87960 KB |
declared answer doesn't correspond to the split scheme: declared = 0, real = 65670 |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Incorrect |
0 ms |
87960 KB |
declared answer doesn't correspond to the split scheme: declared = 0, real = 18364225 |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
3 ms |
87960 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
3 ms |
87960 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
3 ms |
87960 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Incorrect |
3 ms |
87960 KB |
declared answer doesn't correspond to the split scheme: declared = 0, real = 4775671650 |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
87960 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
0 ms |
87960 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
73 ms |
87960 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
87960 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
49 ms |
87960 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
53 ms |
87960 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
53 ms |
87960 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Incorrect |
46 ms |
87960 KB |
declared answer doesn't correspond to the split scheme: declared = 0, real = 18424961489 |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
49 ms |
87960 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
46 ms |
87960 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1189 ms |
87960 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
43 ms |
87960 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
816 ms |
87960 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
723 ms |
87960 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
639 ms |
87960 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Incorrect |
963 ms |
87960 KB |
declared answer doesn't correspond to the split scheme: declared = 0, real = 184497461489 |
| 9 |
Halted |
0 ms |
0 KB |
- |
