#include <bits/stdc++.h>
using namespace std;
struct fCall
{
int nr, st, dr, stOpt, drOpt;
fCall(int nr, int st, int dr, int stOpt, int drOpt)
{
this->nr=nr;
this->st=st;
this->dr=dr;
this->stOpt=stOpt;
this->drOpt=drOpt;
}
};
long long n,k;
long long s[100005];
long long dp[100005][205];
long long last[100005][205];
vector<fCall> fS;
void solve(int nr, int st, int dr, int stOpt, int drOpt)
{
if(st > dr)
return;
int mij=(st+dr)/2;
long long maxi=-1, best=mij;
for(int j=stOpt; j<=min(mij, drOpt); j++)
{
long long nans = (s[mij]-s[j-1])*s[j-1] + dp[j-1][nr-1];
if(nans >= maxi)
{
maxi=nans;
best=j;
}
}
dp[mij][nr]=maxi;
last[mij][nr]=best-1;
fS.push_back(fCall(nr, st, mij-1, stOpt, best));
fS.push_back(fCall(nr, mij+1, dr, best, drOpt));
}
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>s[i];
s[i] += s[i-1];
}
for(int i=1;i<=k;i++)
{
fS.clear();
fS.push_back(fCall(i, 1, n, 1, n));
while(!fS.empty())
{
auto it=fS.back();
fS.pop_back();
solve(it.nr, it.st, it.dr, it.stOpt, it.drOpt);
}
}
cout<<dp[n][k]<<'\n';
int p=n;
int nr=k;
vector<int> ans;
while(true)
{
p=last[p][nr];
nr--;
if(p <= 0)
break;
ans.push_back(p);
}
reverse(ans.begin(), ans.end());
for(int it : ans)
cout<<it<<' ';
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 |
204 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 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 |
0 ms |
332 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 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 |
1 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
460 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
460 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
844 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
844 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
844 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
844 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
844 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
844 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
844 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
844 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
844 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
844 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
3404 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
3404 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
3532 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
3404 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
3528 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
17 ms |
3532 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
17 ms |
3536 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
17 ms |
3532 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
3404 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
3528 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
18 ms |
32428 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
19 ms |
32436 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
145 ms |
32472 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
19 ms |
32420 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
106 ms |
32460 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
146 ms |
32468 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
132 ms |
32460 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
99 ms |
32468 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
112 ms |
32476 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
134 ms |
32468 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
85 ms |
131076 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
