//Convex Hull Trick, verified on CF319C (319 is ID)
import java.io.*; import java.util.*;
public class sequence{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
}
static int[] M;
static long[] B;
static int[] ind;
static int pointer=0;
static short[][] ch; static boolean[][] b1; static boolean[][] b2;
static int N;
static int sz;
public static void main(String[] args){
FastReader br=new FastReader();
N=br.nextInt(); int K=br.nextInt();
int[] s=new int[N];
long[] dp=new long[N];
long[] dp2=new long[N];
ch=new short[N][K]; b1=new boolean[N][K];b2=new boolean[N][K];
s[0]=br.nextInt(); for(int i=1;i<N;i++){s[i]=s[i-1]+br.nextInt(); }
//System.out.println(Arrays.toString(s));
for (int i = 0; i < K; i++) {
M=new int[N];
B=new long[N];
ind=new int[N]; sz=0;
add(s[0],-(long)s[0]*s[0],i);
for (int j = 1; j < N; j++) {
dp2[j]=query((long)s[j],N*i+j);
add(s[j], dp[j]-(long)s[j]*s[j],Math.max(j,i));
//System.out.println(M);
//System.out.println(B);
}
for (int j = 0; j < N; j++) {
dp[j]=dp2[j];
}
//System.out.println(Arrays.toString(dp));
}
//System.out.println(Arrays.toString(dp));
System.out.println(dp[N-1]);
StringBuilder sb=new StringBuilder();
int[] arl=new int[K];
int cur=N-1;
for (int i = K-1; i >=0; i--) {
if(b1[cur][i] && b2[cur][i])cur=(int) 4*ch[cur][i]+3;
else if(b1[cur][i]) cur=(int) 4*ch[cur][i]+1;
else if(b2[cur][i]) cur=(int) 4*ch[cur][i]+2;
else cur=(int) 4*ch[cur][i];
arl[i]=cur+1;
}
//StringBuilder is actually quite memory consuming
for (int i = 0; i <K; i++) {
System.out.print(arl[i]+" ");
}
//System.out.println(sb.toString());
}
public static boolean bad(int l1, int l2, int l3){//Using doubles to prevent overflow
return (M[l1]-M[l3])*((double)B[l2]-B[l1])>=(M[l1]-M[l2])*((double)B[l3]-B[l1]);
//Intersection of l1 and l3 must be ABOVE l2
//For l2 to be added
//l1.m>l2.m>l3.m, as sum is strictly increasing
}
public static void add(int m, long b, int i){
M[sz]=m; B[sz]=b; ind[sz]=i; sz++;
while(sz>=3 && bad(sz-3,sz-2,sz-1)){
M[sz-2]=m; B[sz-2]=b; ind[sz-2]=i; sz--;
}
}
public static long query(long x, int j){
if(pointer>=sz){pointer=sz-1;}
while(pointer<sz-1 &&
M[pointer+1]*x+B[pointer+1] > M[pointer]*x+B[pointer]){
pointer++;
}
ch[j%N][j/N]=(short)(ind[pointer]/4);
if(ind[pointer]%2==1){
b1[j%N][j/N]=true;
}
if(ind[pointer]%4>=2){
b2[j%N][j/N]=true;
}
return M[pointer]*x+B[pointer];
}
}
//Debugging:
//Are you sure your algorithm is correct?
//Bounds: long
//Special cases: n=0,1?
//Make sure you remove your debugging code before you submit!
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
109 ms |
9564 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
111 ms |
9580 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
107 ms |
9580 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
108 ms |
9544 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
112 ms |
9644 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
111 ms |
9660 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
116 ms |
9580 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
115 ms |
9580 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
110 ms |
9580 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
111 ms |
9776 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
113 ms |
9580 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
108 ms |
9708 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
113 ms |
9580 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
115 ms |
9580 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
110 ms |
9668 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
115 ms |
9580 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
109 ms |
9580 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
108 ms |
9616 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
113 ms |
9580 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
116 ms |
9580 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
113 ms |
9564 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
124 ms |
9564 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
113 ms |
9580 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
115 ms |
9580 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
115 ms |
9552 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
111 ms |
9576 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
110 ms |
9708 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
123 ms |
9708 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
112 ms |
9580 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
223 ms |
13856 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
116 ms |
9720 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
210 ms |
13696 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
207 ms |
13928 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
209 ms |
14072 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
141 ms |
10448 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
128 ms |
9708 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
149 ms |
10704 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
127 ms |
9756 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
123 ms |
9708 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
209 ms |
15312 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
129 ms |
9836 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
212 ms |
15920 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
212 ms |
15784 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
216 ms |
15796 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
216 ms |
15912 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
199 ms |
14000 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
203 ms |
15016 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
371 ms |
16260 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
377 ms |
16516 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
503 ms |
26328 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
367 ms |
16040 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
464 ms |
23044 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
474 ms |
24324 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
491 ms |
24608 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
457 ms |
23684 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
472 ms |
24196 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
506 ms |
25864 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
473 ms |
31412 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
484 ms |
31644 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Runtime error |
651 ms |
131072 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
4 |
Halted |
0 ms |
0 KB |
- |