#include<iostream>
#include<deque>
#include<fstream>
using namespace std;
ifstream fin("./sequence/53");
long long d[100007][205],n,k,a[200000],A[200000],opt[100007][205];
long long i,j,cur;
deque<pair<long long,long long> > q;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>a[i];
A[i]=A[i-1]+a[i];
}
for(j=1;j<=k;j++)
{
for(i=j+1;i<=n;i++)
{
for(int cur=max(opt[i][j-1],max(opt[i-1][j],j));cur<=i;cur++)
{
if((A[i]-A[cur])*A[cur]+d[cur][j-1]>=d[i][j])
{
d[i][j] = (A[i]-A[cur])*A[cur]+d[cur][j-1];
opt[i][j]=cur;
}
}
}
}
cout<<d[n][k]<<endl;
long long l=n,r=k;
for(i=n-1;i>=1;i--)
{
if((A[l]-A[i])*A[i]+d[i][r-1]==d[l][r])
{
cout<<i<<" ";
r--;
if(r==0)
break;
l=i;
}
}
return 0;
}
/*
7 3
4 1 3 4 0 2 3*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
484 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
3 ms |
596 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
596 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
672 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
728 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
3 ms |
728 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
728 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
728 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
3 ms |
728 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
3 ms |
728 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
4 ms |
728 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
728 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
728 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
728 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
728 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
732 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
864 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
868 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
872 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
3 ms |
880 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
3 ms |
884 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
3 ms |
952 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
4 ms |
952 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
3 ms |
1068 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
1068 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1460 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
4 ms |
1464 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
1472 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
3 ms |
1472 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
4 ms |
1496 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
5 ms |
1500 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
5 ms |
1504 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
4 ms |
1508 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
1508 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
4 ms |
1516 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
4080 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
8 ms |
4084 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
15 ms |
4136 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
9 ms |
4136 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
17 ms |
4136 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
4136 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
17 ms |
4136 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
14 ms |
4204 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
11 ms |
4204 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
13 ms |
4232 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
194 ms |
33220 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
777 ms |
33240 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
644 ms |
33388 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
199 ms |
33388 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
921 ms |
33532 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
601 ms |
33532 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
557 ms |
33532 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
597 ms |
33724 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
612 ms |
33724 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
676 ms |
33800 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2063 ms |
120632 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
