#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,k,p[100005];
ll sum[100005],d[2][100005];
int go[205][100005];
void f(int now,int l,int r,int rl,int rr) {
if(l > r) return;
int x;
ll t;
x = (l + r) >> 1;
d[now%2][x] = -1;
for(int i = max(x,rl);i <= rr;i++) {
t = d[(now+1) % 2][i+1]+(sum[x]-sum[i+1])*sum[i+1];
if(t > d[now % 2][x]) {
d[now % 2][x] = t;
go[now][x] = i;
}
}
f(now,l,x-1,rl,go[now][x]);
f(now,x+1,r,go[now][x],rr);
}
void printTrack(int now,int x)
{
if(now == 0) return;
printf("%d ",go[now][x]);
printTrack(now-1,go[now][x]+1);
}
int main() {
scanf("%d %d",&n,&k);
for(int i = 1;i <= n;i++) {
scanf("%d",&p[i]);
}
for(int i = n;i >= 1;i--) {
sum[i] = sum[i+1]+p[i];
}
for(int i = 1;i <= k;i++) {
f(i,1,n,1,n);
}
printf("%lld\n",d[k%2][1]);
printTrack(k,1);
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&k);
~~~~~^~~~~~~~~~~~~~~
sequence.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&p[i]);
~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
380 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 |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
4 ms |
380 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
376 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 |
380 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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
3 ms |
376 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 |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
7 ms |
376 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 |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
404 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1400 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1144 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
1272 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1400 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
632 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
504 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
2168 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
404 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
2168 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
1912 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
2040 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
2040 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
760 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
1144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
760 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
1 ms |
760 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
92 ms |
9404 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
760 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
98 ms |
5816 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
87 ms |
6776 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
93 ms |
7260 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
67 ms |
6084 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
86 ms |
6776 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
108 ms |
8628 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
43 ms |
4480 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
43 ms |
4452 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1022 ms |
81968 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
33 ms |
4728 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1673 ms |
81704 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1046 ms |
58176 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1028 ms |
62380 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
758 ms |
51248 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
935 ms |
58356 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1183 ms |
73904 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
