#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll,ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 1000000000000000000
struct t{
ll x,y,q;
};
bool check(t a,t b,t c){
return (c.y-b.y)*(a.x-b.x)<=(b.y-a.y)*(b.x-c.x);
}
ll n,m,s[100005],dp[205][100005],b[205][100005],l,r;
t dq[100005];
vector<int>ans;
int main(void){
scanf("%lld%lld",&n,&m);
m++;
for(int i=1;i<=n;i++){
ll a;
scanf("%lld",&a);
s[i]=s[i-1]+a;
}
for(int i=0;i<=m;i++)for(int j=0;j<=n;j++)dp[i][j]=INF;
dp[0][0]=0;
for(int i=1;i<=m;i++){
l=0,r=0;
for(int j=1;j<=n;j++){
if(dp[i-1][j-1]<INF){
t p=t{-2LL*s[j-1],s[j-1]*s[j-1]+dp[i-1][j-1],j-1};
while(r-2>=l&&check(dq[r-2],dq[r-1],p))r--;
dq[r++]=p;
while(l+1<r&&dq[l].x*s[j]+dq[l].y>=dq[l+1].x*s[j]+dq[l+1].y)l++;
}
if(l<r){
b[i][j]=dq[l].q;
dp[i][j]=dq[l].x*s[j]+dq[l].y+s[j]*s[j];
}
}
}
printf("%lld\n",(s[n]*s[n]-dp[m][n])/2LL);
int x=n;
for(int i=m;i>1;i--){
ans.PB(b[i][x]);
x=b[i][x];
}
for(int i=ans.size()-1;i>=0;i--){
printf("%d",ans[i]);
if(i==0)printf("\n");
else printf(" ");
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld",&n,&m);
~~~~~^~~~~~~~~~~~~~~~~~
sequence.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld",&a);
~~~~~^~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
8 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
3 ms |
896 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
5 ms |
3072 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
5 ms |
2304 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
5 ms |
2816 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
6 ms |
3072 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
3 ms |
1152 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
9 ms |
5504 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
11 ms |
5632 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
9 ms |
4864 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
8 ms |
5504 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
9 ms |
5632 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
1408 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
5 ms |
2560 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
1408 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
4 ms |
1408 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
46 ms |
34140 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
4 ms |
1408 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
41 ms |
20804 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
47 ms |
24188 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
63 ms |
25848 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
37 ms |
21240 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
54 ms |
24196 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
55 ms |
30840 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
23 ms |
10104 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
30 ms |
9976 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Runtime error |
142 ms |
132096 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
4 |
Halted |
0 ms |
0 KB |
- |