#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
lli p[100002],p1[100002],dp[2][100002];
int kval[202][100002];
void cal(int g,int s,int e,int sl,int se)
{
lli mid=(s+e)/2,k=sl;
for(lli i=sl;i<=se;++i)
{
if(i>=mid&&dp[1][mid]>(((p[i]-p[mid-1])*(p[i]-p[mid-1])-(p1[i]-p1[mid-1]))/2)+dp[1-1][i+1])
{
dp[1][mid]=(((p[i]-p[mid-1])*(p[i]-p[mid-1])-(p1[i]-p1[mid-1]))/2)+dp[1-1][i+1];
k=i;
}
}
kval[g][mid]=k;
if(s!=e)
{
if(mid-1>=s)
cal(g,s,mid-1,sl,k);
if(mid+1<=e)
cal(g,mid+1,e,k,se);
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli test=1;
for(;test>0;--test)
{
lli n,k,f;
cin>>n>>k;
k++;
p[0]=0;
p1[0]=0;
for(lli i=1;i<=n;++i)
{
cin>>f;
p[i]=p[i-1]+f;
p1[i]=p1[i-1]+(f*f);
}
for(lli i=1;i<=n;++i)
{
dp[0][i]=(p[n]-p[i-1])*(p[n]-p[i-1])-(p1[n]-p1[i-1]);
dp[0][i]/=2;
kval[1][i]=n;
}
for(lli i=2;i<=k;++i)
{
for(int j=0;j<=100001;++j)
dp[1][j]=150000000000000000;
cal(i,1,n-i+1,1,n);
swap(dp[0],dp[1]);
}
cout<<((p[n]*p[n]-p1[n])/2)-dp[0][1]<<endl;
lli now=1;
while(k!=1)
{
cout<<kval[k][now]<<' ';
now=kval[k][now]+1;
k--;
}
cout<<endl;
}
return(0);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
1792 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
12 ms |
2176 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
7 ms |
1920 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
8 ms |
2048 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
7 ms |
1920 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
7 ms |
1920 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
31 ms |
2920 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
7 ms |
1920 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
24 ms |
2684 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
29 ms |
2816 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
31 ms |
2936 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
12 ms |
2176 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
9 ms |
2048 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
13 ms |
2176 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
2176 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
38 ms |
3576 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
40 ms |
3568 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
35 ms |
3320 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
40 ms |
3576 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
35 ms |
3576 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
12 ms |
2304 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
20 ms |
2688 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
2176 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
8 ms |
2304 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
110 ms |
10744 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
8 ms |
2304 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
101 ms |
7280 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
110 ms |
8184 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
111 ms |
8700 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
75 ms |
7416 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
100 ms |
8184 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
125 ms |
9976 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
38 ms |
5112 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
37 ms |
4984 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
903 ms |
82200 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
26 ms |
4992 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1595 ms |
82444 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1002 ms |
59000 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
927 ms |
63248 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
668 ms |
51960 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
899 ms |
59136 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1134 ms |
74632 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
