#include <bits/stdc++.h>
#define pll pair<long long, long long>
#define x first
#define y second
using namespace std;
const int N = 1e5 + 10;
struct data {
long long m, c;
int idx;
data() { }
data( long long m, long long c, int idx ) : m( m ), c( c ), idx( idx ) { }
};
struct convex_hull {
vector<data> vec;
int ptr = 0;
bool del( data l3, data l2, data l1 ) { return ( l1.c - l3.c ) * ( l3.m - l2.m ) <= ( l2.c - l3.c ) * ( l3.m - l1.m ); }
void add( data d ) {
while( vec.size() > 2 && del( vec[(int)vec.size()-2], vec.back(), d ) ) vec.pop_back();
while( !vec.empty() && vec.back().m == d.m && vec.back().c <= d.c ) vec.pop_back();
vec.emplace_back( d );
}
long long get( long long x, int pos ) { return vec[pos].m * x + vec[pos].c; }
pll query( long long x ) {
if( ptr >= vec.size() ) ptr = vec.size() - 1;
while( ptr + 1 < vec.size() && get( x, ptr ) <= get( x, ptr + 1 ) ) ptr++;
return pll( get( x, ptr ), vec[ptr].idx );
}
void clear() {
vec.clear();
ptr = 0;
}
};
convex_hull hull;
int n, k, s[210][N];
long long dp[2][N], sum[N];
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 i = 1 ; i <= k ; i++ ) {
hull.clear();
for( int j = 1 ; j <= n ; j++ ) {
hull.add( data( sum[j-1], -1*sum[j-1]*sum[j-1] + dp[(i-1)%2][j-1], j-1 ) );
tie( dp[i%2][j], s[i][j] ) = hull.query( sum[j] );
}
}
printf("%lld\n",dp[k%2][n]);
for( int i = k, z = n ; i > 0 ; i-- ) printf("%d ",z = s[i][z]);
return 0;
}
Compilation message
sequence.cpp: In member function 'std::pair<long long int, long long int> convex_hull::query(long long int)':
sequence.cpp:28:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if( ptr >= vec.size() ) ptr = vec.size() - 1;
~~~~^~~~~~~~~~~~~
sequence.cpp:29:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while( ptr + 1 < vec.size() && get( x, ptr ) <= get( x, ptr + 1 ) ) ptr++;
~~~~~~~~^~~~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:44:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&k);
~~~~~^~~~~~~~~~~~~~~
sequence.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld",&sum[i]);
~~~~~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
6 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
4 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
380 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
4 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
4 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
1272 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
1016 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
1272 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
1272 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
632 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
632 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
2168 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
2168 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
1912 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
2168 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
2200 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
760 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
1144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
952 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
956 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
38 ms |
9588 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
1140 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
36 ms |
6064 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
37 ms |
6968 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
45 ms |
7608 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
28 ms |
6260 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
32 ms |
7028 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
40 ms |
8688 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
33 ms |
5856 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
24 ms |
5860 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
346 ms |
83428 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
25 ms |
6368 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
503 ms |
82916 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
318 ms |
59452 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
354 ms |
63804 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
239 ms |
52964 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
276 ms |
59744 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
349 ms |
75356 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
