#include<bits/stdc++.h>
using namespace std;
const long long int INF=12345678912345678;
const int maxn=100010;
const int maxk=210;
int n, d;
int a[maxn];
long long int parc[maxn], parc_2[maxn];
long long int s_2[maxn];
long long int S_2(int i, int j){
return s_2[j]-s_2[i-1]-parc[i-1]*(parc[j]-parc[i-1]);
}
long long int dp[maxn][maxk];
int opt[maxn][maxk];
void resolve(int k, int ini, int fin, int opt_min, int opt_max){
int m=(ini+fin)/2;
dp[m][k]=INF;
for(int l=opt_min; l<=opt_max; l++){
if(dp[m][k]>dp[l][k-1]+S_2(l+1, m)){
dp[m][k]=dp[l][k-1]+S_2(l+1, m);
opt[m][k]=l;
}
}
if(ini!=fin){
resolve(k, ini, m, opt_min, opt[m][k]);
resolve(k, m+1, fin, opt[m][k], opt_max);
}
return;
}
int main(){
scanf("%d %d", &n, &d);
for(int i=1; i<=n; i++){
scanf("%d", &a[i]);
parc[i]=parc[i-1]+a[i];
parc_2[i]=parc_2[i-1]+a[i]*a[i];
s_2[i]=(parc[i]*parc[i]-parc_2[i])/2;
}
for(int i=1; i<=n; i++) dp[i][0]=s_2[i];
for(int k=1; k<=d; k++){
resolve(k, 1, n, 1, n);
}
printf("%lld\n", s_2[n]-dp[n][d]);
/* for(int i=1; i<=n; i++){
for(int k=1;k<=d; k++){
printf("%d ", dp[i][k]);
}
printf("\n");
}
*/
int at=n;
vector<int> aux;
for(int i=d; i>=1; i--){
aux.push_back(opt[at][i]);
at=opt[at][i];
}
for(int i=d-1; i>=0; i--) printf("%d ", aux[i]);
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &d);
~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &a[i]);
~~~~~^~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
248 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
508 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
508 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
888 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
888 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
4 ms |
888 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
888 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
4 ms |
888 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
4 ms |
888 KB |
position 1 occurs twice in split scheme |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
2808 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
4 ms |
2856 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
14 ms |
2936 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
4 ms |
2808 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
20 ms |
2808 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
17 ms |
2908 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
16 ms |
2808 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
14 ms |
2808 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
2808 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
9 ms |
2808 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
25 ms |
25208 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
25 ms |
25336 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
182 ms |
25336 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
24 ms |
25336 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
162 ms |
25436 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
175 ms |
25336 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
164 ms |
25320 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
128 ms |
25208 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
160 ms |
25336 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
212 ms |
25336 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
118 ms |
131076 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
