#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=9e18;
int N,K;
int Prev[201][1001];
ll A[1001],DP[201][1001];
stack<int> S;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>N>>K;
for (int i=1; i<=N; i++){
cin>>A[i];
A[i]+=A[i-1];
}
for (int t=1; t<=K; t++){
for (int i=t+1; i<=N; i++){
DP[t][i]=-1;
for (int j=t; j<i; j++){
if (DP[t][i]<DP[t-1][j]+(A[i]-A[j])*A[j]){
DP[t][i]=DP[t-1][j]+(A[i]-A[j])*A[j];
Prev[t][i]=j;
}
}
}
}
cout<<DP[K][N]<<"\n";
for (int t=K,i=N; t; t--){
S.push(Prev[t][i]);
i=Prev[t][i];
}
while (!S.empty()){
cout<<S.top()<<" ";
S.pop();
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
328 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
288 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
716 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1996 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
1484 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1868 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1992 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
704 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
460 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
844 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
4 ms |
352 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
95 ms |
2552 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
130 ms |
2628 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
111 ms |
2300 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
96 ms |
2572 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
92 ms |
2620 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
33 ms |
776 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
78 ms |
1164 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
194 ms |
468 KB |
declared answer doesn't correspond to the split scheme: declared = 2097780620314217484, real = 874873322 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2059 ms |
1704 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
