#include <bits/stdc++.h>
#define ll long long
#define x first
#define y second
using namespace std;
int n,m,arr[100005],pv[100005][205];
ll DP[100005][2],sum[100005];
struct cht{
int s=0,e=0,num[100005];
pair<ll,ll> p[100005];
void clear(){
s=0,e=0;
}
double cross(pair<ll,ll> a,pair<ll,ll> b){
return 1.0*(a.y-b.y)/(b.x-a.x);
}
ll f(ll a,ll b){
return p[a].x*b+p[a].y;
}
pair<ll,ll> qry(ll x){
while(s+1<e&&cross(p[s],p[s+1])<=x) s++;
return {f(s,x),num[s]};
}
void udt(ll a,ll b,int k){
p[e]={a,b}; num[e]=k;
while(s<e&&p[e-1].x==p[e].x&&p[e-1].y<=p[e].y){
p[e-1]=p[e],num[e-1]=num[e],e--;
}
while(s+1<e&&cross(p[e-2],p[e-1])>=cross(p[e-1],p[e])) num[e-1]=num[e],p[e-1]=p[e],e--;
e++;
}
} cht;
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%lld",arr+i),sum[i]=sum[i-1]+arr[i];
for(int j=1;j<=m;j++){
cht.clear();
for(int i=1;i<=n;i++){
pair<ll,int> qry=cht.qry(sum[i]);
DP[i][j%2]=qry.x; pv[i][j]=qry.y;
cht.udt(sum[i],-sum[i]*sum[i]+DP[i][(j+1)%2],i);
}
}
printf("%lld\n",DP[n][m%2]);
function<void (int,int)> solve = [&](int a,int b){
if(b==0) return;
solve(pv[a][b],b-1);
printf("%d ",pv[a][b]);
return;
};
solve(n,m);
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:36:37: warning: format '%lld' expects argument of type 'long long int*', but argument 2 has type 'int*' [-Wformat=]
36 | for(int i=1;i<=n;i++) scanf("%lld",arr+i),sum[i]=sum[i-1]+arr[i];
| ~~~^ ~~~~~
| | |
| | int*
| long long int*
| %d
sequence.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
35 | scanf("%d%d",&n,&m);
| ~~~~~^~~~~~~~~~~~~~
sequence.cpp:36:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
36 | for(int i=1;i<=n;i++) scanf("%lld",arr+i),sum[i]=sum[i-1]+arr[i];
| ~~~~~^~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
1900 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
1920 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
1900 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
2028 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
2028 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
2156 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
2028 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
2796 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
2796 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
2796 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
2796 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
2796 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
2796 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
2796 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
2796 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
10220 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
10220 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
52 ms |
10348 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
8 ms |
10348 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
43 ms |
10348 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
44 ms |
10220 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
54 ms |
10220 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
38 ms |
10240 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
48 ms |
10348 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
52 ms |
10220 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
59 ms |
85228 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
58 ms |
85228 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
589 ms |
85228 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
60 ms |
85228 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
709 ms |
85228 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
482 ms |
85352 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
554 ms |
85308 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
412 ms |
85356 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
444 ms |
85228 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
552 ms |
85228 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
