#include <bits/stdc++.h>
#define N 100005
#define PB push_back
#define ll long long
using namespace std;
int n, k, trace[205][N];
ll s[N], dp[N], poller;
vector <long long > v, u, vl, ul, p, pl;
bool check(ll x, ll y, ll z)
{
return (v[z] - v[x])*(u[x] - u[y]) <= (v[y] - v[x])*(u[x] - u[z]);
}
void add(ll x, ll y, ll vt)
{
u.PB(x);
v.PB(y);
p.PB(vt);
while (u.size() >= 3 && check(u.size()-3, u.size()-2, u.size()-1))
{
u.erase(u.end()-2);
v.erase(v.end()-2);
p.erase(p.end()-2);
}
}
ll get(ll x, ll val)
{
return ul[x]*val+vl[x];
}
ll get_ans(ll val)
{
if (poller >= ul.size()) poller = ul.size()-1;
while (poller < ul.size()-1 && get(poller+1, val) >= get(poller, val)) poller++;
return get(poller, val);
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen("SEQUENCE.INP", "r", stdin);
//freopen("SEQUENCE.OUT", "w", stdout);
cin >> n >> k;
for (ll i = 1; i <= n; i++)
{
cin >> s[i];
s[i] += s[i-1];
}
for (ll i = 1; i <= n; i++)
{
dp[i] = s[i]*(s[n] - s[i]);
add(s[i], dp[i] - s[i]*s[n], i);
}
swap(ul, u); swap(vl, v); swap(pl, p);
for (ll i = 2; i <= k; i++)
{
poller = 0;
for (ll j = i; j <= n; j++)
{
dp[j] = get_ans(s[j]) + s[j]*s[n] - s[j]*s[j];
trace[i][j] = pl[poller];
add(s[j], dp[j] - s[j]*s[n], j);
}
swap(ul, u); swap(vl, v); swap(pl, p);
u.clear();
v.clear();
p.clear();
}
ll res = -1; ll pos = 0; ll dem = k;
for (ll i = 1; i <= n; i++)
if (res <= dp[i])
{
res = dp[i];
pos = i;
}
cout <<res<<endl;
vector<ll> ans;
while (dem > 0)
{
ans.PB(pos);
pos = trace[dem--][pos];
}
sort(ans.begin(), ans.end());
for (ll &v : ans) cout <<v<<" ";
}
Compilation message
sequence.cpp: In function 'long long int get_ans(long long int)':
sequence.cpp:33:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (poller >= ul.size()) poller = ul.size()-1;
^
sequence.cpp:34:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (poller < ul.size()-1 && get(poller+1, val) >= get(poller, val)) poller++;
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Incorrect |
0 ms |
83828 KB |
Integer 2 violates the range [1, 1] |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
0 ms |
83828 KB |
Integer 200 violates the range [1, 199] |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
3 ms |
83828 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
3 ms |
83828 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
83828 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
83828 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
0 ms |
83828 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
84308 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
0 ms |
84308 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
43 ms |
84676 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
0 ms |
84676 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
46 ms |
84308 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
49 ms |
84308 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
43 ms |
84676 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
26 ms |
84676 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
33 ms |
84676 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
49 ms |
84676 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
91052 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
23 ms |
91052 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
503 ms |
91052 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
26 ms |
91052 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
886 ms |
91052 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
576 ms |
88992 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
589 ms |
91052 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
363 ms |
91052 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
399 ms |
91052 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
633 ms |
91052 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
