#include <bits/stdc++.h>
#define int long long
using namespace std;
const int oo = INT_MAX;
int n,k;
int v[100005];
int sp[100005];
int dp[100005][2];
signed l[100005][205];
int sum(int st, int dr)
{
if(st > dr)
{
return 0;
}
return sp[dr] - sp[st - 1];
}
void divide(int st, int dr, int min_chosen, int max_chosen, int j)
{
if(st > dr)
{
return;
}
int mij = (st + dr) >> 1;
dp[mij][j % 2] = -oo;
for(int p=min_chosen; p<=min(max_chosen,mij); p++)
{
if(dp[p-1][(j-1) % 2] + sum(p,mij) * sum(mij + 1, n) >= dp[mij][j % 2])
{
dp[mij][j % 2] = dp[p-1][(j-1) % 2] + sum(p,mij) * sum(mij + 1, n);
l[mij][j] = p - 1;
}
}
divide(st,mij-1,min_chosen,l[mij][j] + 1,j);
divide(mij+1,dr,l[mij][j]+1,max_chosen,j);
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>k;
++k;
for(int i=1; i<=n; i++)
{
cin>>v[i];
sp[i] = sp[i-1] + v[i];
}
for(int i=1; i<=n; i++)
{
dp[i][1] = sum(1,i) * sum(i + 1, n);
}
for(int j=2; j<=k; j++)
{
divide(1,n,1,n,j);
}
cout<<dp[n][k % 2]<<'\n';
int poz = n;
vector<int> rez;
while(poz)
{
poz = l[poz][k--];
if(poz)
{
rez.push_back(poz);
}
}
reverse(rez.begin(),rez.end());
for(auto it : rez)
{
cout<<it<<' ';
}
cout<<'\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
328 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
456 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
10 ms |
1108 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
1092 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1108 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
1108 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
1108 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1108 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1180 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
8604 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
8704 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
85 ms |
8656 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
8660 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
68 ms |
8688 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
69 ms |
8684 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
78 ms |
8712 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
58 ms |
8660 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
64 ms |
8608 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
92 ms |
8704 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
57 ms |
83788 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
56 ms |
83872 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1574 ms |
84224 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
56 ms |
84172 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1622 ms |
83840 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1103 ms |
83892 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1315 ms |
84156 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
986 ms |
84048 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1088 ms |
84024 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1458 ms |
84028 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
