//Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100001, K = 201;
ll dp[2][N], p[N];
int par[K][N];
struct CHT{
vector<ll> m, b, id;
int ptr = 0;
bool bad(int l1, int l2, int l3) {
return (b[l3] - b[l1]) * (m[l1] - m[l2]) <= (b[l2] - b[l1]) * (m[l1] - m[l3]);
}
void clear() {
ptr = 0;
m.clear();
b.clear();
id.clear();
}
void add(ll _m, ll _b, ll idx) {
m.push_back(_m);
b.push_back(_b);
id.push_back(idx);
int s = m.size();
while(s >= 3 && bad(s-3, s-2, s-1)) {
s--;
m.erase(m.end()-2);
b.erase(b.end()-2);
id.erase(id.end()-2);
}
}
ll f(int i, ll x) { return m[i]*x + b[i]; }
pair<ll,ll> query(ll x) {
if(ptr >= m.size()) ptr = m.size()-1;
while(ptr < m.size()-1 &&
f(ptr+1, x) >= f(ptr, x)) ptr++;
return {id[ptr], f(ptr, x)};
}
};
void recon(int k, int n) {
if(!k) return;
recon(k-1, par[k][n]);
cout<<par[k][n]<<" ";
}
int main(int argc, char const *argv[]) {
#ifdef LOCAL_TESTING
freopen("in", "r", stdin);
#endif
int n, kk; cin>>n>>kk;
for(int i=1; i <= n; i++) {
cin>>p[i];
p[i] += p[i-1];
}
for(int i=0; i<=1; i++)
for(int j=0; j<=n; j++)
dp[i][j] = -1e18;
for(int i=0; i<=n; i++)
dp[0][i] = 0;
CHT ds;
for(int _k=1; _k <= kk; _k++) {
ds.clear();
ds.add(0, 0, 0);
int k = _k & 1;
for(int i=_k; i<=n; i++) {
auto it = ds.query(p[i]);
dp[k][i] = it.second;
ds.add(p[i], dp[k ^ 1][i] - p[i] * p[i], i);
par[_k][i] = it.first;
}
}
cout<<dp[kk & 1][n]<<endl;
recon(kk, n);
}
Compilation message
sequence.cpp: In member function 'std::pair<long long int, long long int> CHT::query(ll)':
sequence.cpp:36:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(ptr >= m.size()) ptr = m.size()-1;
^
sequence.cpp:37:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(ptr < m.size()-1 &&
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
3 ms |
82880 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
82880 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
3 ms |
82880 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
82880 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
3 ms |
82880 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
83212 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
83212 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
36 ms |
83344 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
0 ms |
83344 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
39 ms |
83212 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
46 ms |
83212 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
53 ms |
83344 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
19 ms |
83344 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
43 ms |
83344 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
43 ms |
83344 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
26 ms |
86556 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
39 ms |
86556 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
449 ms |
86556 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
49 ms |
86556 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
753 ms |
86556 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
563 ms |
86556 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
476 ms |
86556 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
359 ms |
86556 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
379 ms |
86556 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
526 ms |
86556 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
