#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz size()
#define pb pop_back()
ll Dp[101010][2];
int Dir[101010][202],n,k,pos,a,b;
ll S[101010];
struct line{ll a,b,num;};
double cross(line a,line b){return (double)(b.b-a.b)/(a.a-b.a);}
vector<line> cht;
vector<int> ans;
ll Q(ll x,int& d)
{
while(pos < cht.sz-1 && cross(cht[pos],cht[pos+1]) <= x) pos++;
d = cht[pos].num;
return cht[pos].a * x + cht[pos].b;
}
void push(line x)
{
if(!cht.empty())
{
if(cht[cht.sz-1].a == x.a) return;// 얘는 안넣음
}
while(cht.sz > 1)
{
if(cross(cht[cht.sz-1],cht[cht.sz-2]) <= cross(cht[cht.sz-1],x)) break;
cht.pb;
}
cht.push_back(x);
}
main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL),cout.tie(NULL);
cin>>n>>k;
for(int i = 1 ; i <= n ; i++) cin>>S[i],S[i] += S[i-1];
for(int i = 1 ; i <= n ; i++) Dp[i][1] = S[i]*S[i];
for(int i = 2 ; i <= k+1 ; i++)
{
cht.clear(),pos = 0,b=(i+1)%2;
cht.push_back({-2*S[i-1],S[i-1]*S[i-1]+Dp[i-1][b],i-1});
for(int q = i ; q <= n ; q++)
{
Dp[q][i%2] = Q(S[q],Dir[q][i])+S[q]*S[q];
push({-2*S[q],S[q]*S[q]+Dp[q][b],q});
}
}
cout<<(S[n]*S[n]-Dp[n][(k+1)%2])/2<<"\n";
ll tar = Dir[n][k+1];
for(int i = k+1 ; i > 1 ; i--)
{
ans.push_back(tar);
tar = Dir[tar][i-1];
}
for(int i = ans.size()-1 ; i > -1 ; i--) cout<<ans[i]<<" ";
}
Compilation message
sequence.cpp: In function 'll Q(ll, int&)':
sequence.cpp:18:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<line>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
18 | while(pos < cht.sz-1 && cross(cht[pos],cht[pos+1]) <= x) pos++;
| ~~~~^~~~~~~~~~
sequence.cpp: At global scope:
sequence.cpp:35:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
35 | main()
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
492 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1260 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1260 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
1260 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1260 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
1260 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1260 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
1260 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
1260 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1260 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1260 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
9004 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
8876 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
72 ms |
8936 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
8936 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
49 ms |
8876 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
52 ms |
8876 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
65 ms |
8936 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
46 ms |
8936 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
57 ms |
8808 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
63 ms |
8808 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
57 ms |
83952 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
54 ms |
83932 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
767 ms |
84700 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
57 ms |
84700 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
823 ms |
84040 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
566 ms |
83932 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
677 ms |
84700 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
496 ms |
84572 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
532 ms |
84316 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
686 ms |
84316 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
