#include<bits/stdc++.h>
using namespace std ;
//code copied from arman_ferdous
//dp[i][j] means the maximum cost we can get
//if we do the j'th cut in between a[i] and a[i+1]
//the array m is going to be in increasing order
using ll = long long ;
const int N = 100005 , K = 205 ;
const ll INF = 1e18 ;
int n , k , opt[N][K] ;
ll sum[N] , dp[N][2] ;
struct CHT{
ll m[N] , b[N] ;
int idx[N] , siz , last ;
void init() {siz = last = 0; }
bool bad(int i , int j , int k)
{
return (b[j] - b[i])*(m[i] - m[k]) >= (b[k] - b[i])*(m[i] - m[j]) ;
}
void add(ll M , ll B , int idx_)
{
m[siz] = M , b[siz] = B , idx[siz] = idx_ , ++siz ;
while((siz>=3) && bad(siz-3,siz-2,siz-1))
{
m[siz-2] = m[siz-1] ;
b[siz-2] = b[siz-1] ;
idx[siz-2] = idx[siz-1] ;
--siz ;
}
}
ll f(int i , ll X) { return (m[i] * X) + b[i] ; }
pair<ll , int> query(ll X)
{
last = min(last , siz-1) ;
while(((last+1)<siz) && (f(last,X)<=f(last+1,X))) ++last ;
return {f(last,X),idx[last]} ;
}
} ds ;
int main()
{
scanf("%d%d",&n,&k) ;
for(int i = 1 ; i <= n ; ++i)
{
scanf("%lld",&sum[i]) ;
sum[i] += sum[i-1] ;
}
for(int j = 1 ; j <= k ; ++j)
{
int col = (j&1) ;
ds.init() ;
ds.add(0,0,0) ;
for(int i = j ; i <= n ; ++i)
{
auto got = ds.query(sum[i]) ;
dp[i][col] = got.first ;
opt[i][j] = got.second ;
ds.add(sum[i],dp[i][(col^1)] - (sum[i]*sum[i]),i) ;
}
}
printf("%lld\n",dp[n][(k&1)]) ;
while(n && k)
{
printf("%d ",opt[n][k]) ;
n = opt[n][k] ;
--k ;
}
return 0 ;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:50:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
50 | scanf("%d%d",&n,&k) ;
| ~~~~~^~~~~~~~~~~~~~
sequence.cpp:53:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
53 | scanf("%lld",&sum[i]) ;
| ~~~~~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
364 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 |
492 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 |
364 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 |
512 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 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 |
492 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 |
1132 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1132 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
3 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 |
5 ms |
1132 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
1132 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
4 ms |
1260 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
3 ms |
1260 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1132 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
1280 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
8812 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
8940 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
34 ms |
8940 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
8908 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
31 ms |
8812 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
32 ms |
8812 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
34 ms |
8812 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
25 ms |
8812 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
27 ms |
8812 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
34 ms |
8812 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
60 ms |
84460 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
60 ms |
84716 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
539 ms |
85484 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
60 ms |
85484 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
600 ms |
84844 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
422 ms |
84844 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
453 ms |
85484 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
370 ms |
85228 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
410 ms |
85100 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
500 ms |
85100 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
