#include<bits/stdc++.h>
#define SIZE 100001
using namespace std;
typedef long long ll;
struct line
{
ll a,b;
};
ll A[SIZE],dp[SIZE][2],psum[SIZE];
int N,K,idx[SIZE][201],sw;
vector<line>v;
double cross(line x,line y)
{
return (double)(y.b-x.b)/(psum[x.a]-psum[y.a]);
}
void ins(line x)
{
if(!v.empty()&&psum[v.back().a]==psum[x.a]){
if(v.back().b<x.b)v.back().b=x.b;
return;
}
while(v.size()>=2){
if(cross(v.back(),v[v.size()-2])>cross(v.back(),x))v.pop_back();
else break;
}
v.push_back(x);
}
pair<ll,ll>query(ll x)
{
if(v.size()<=sw)sw=v.size()-1;
while(sw+1<v.size()&&cross(v[sw+1],v[sw])<=x)sw++;
return {psum[v[sw].a]*x+v[sw].b,v[sw].a};
}
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0);
cin>>N>>K;
for(int i=1;i<=N;i++){
cin>>A[i];
psum[i]=psum[i-1]+A[i];
}
for(int i=1;i<=K;i++){
sw=0;
v.clear();
for(int j=i+1;j<=N;j++){
ins({j-1,dp[j-1][0]-psum[j-1]*psum[j-1]});
pair<ll,ll>t=query(psum[j]);
dp[j][1]=t.first;
idx[j][i]=t.second;
}
for(int j=1;j<=N;j++)dp[j][0]=dp[j][1];
}
vector<int>ans;
int x=N;
for(int i=K;i>=1;i--){
ans.push_back(idx[x][i]);
x=idx[x][i];
}
printf("%lld\n",dp[N][1]);
for(int i=ans.size()-1;i>=0;i--)printf("%d ",ans[i]);
}
Compilation message
sequence.cpp: In function 'std::pair<long long int, long long int> query(ll)':
sequence.cpp:30:16: warning: comparison of integer expressions of different signedness: 'std::vector<line>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
30 | if(v.size()<=sw)sw=v.size()-1;
| ~~~~~~~~^~~~
sequence.cpp:31:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
31 | while(sw+1<v.size()&&cross(v[sw+1],v[sw])<=x)sw++;
| ~~~~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
1108 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
1108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
1108 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
1108 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
1108 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1108 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1108 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
8660 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
8660 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
42 ms |
8792 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
8792 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
40 ms |
8660 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
40 ms |
8780 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
49 ms |
8792 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
31 ms |
8792 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
36 ms |
8792 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
44 ms |
8792 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
55 ms |
83432 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
48 ms |
83392 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
558 ms |
83748 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
47 ms |
83728 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
693 ms |
83632 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
460 ms |
83448 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
534 ms |
83776 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
392 ms |
83788 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
422 ms |
83612 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
550 ms |
83548 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
