#include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const int MAX=1e5+5;
ll dp[205][MAX];
ll tab[MAX];
int pref[MAX];
ll prefix(int a,int b)
{
return pref[b]-pref[a-1];
}
struct Line {
mutable ll k, m, p;
bool operator<(const Line& o) const { return k < o.k; }
bool operator<(ll x) const { return p < x; }
};
struct LineContainer : multiset<Line, less<>> {
// (for doubles, use inf = 1/.0, div(a,b) = a/b)
const ll inf = LLONG_MAX;
ll div(ll a, ll b) { // floored division
return a / b - ((a ^ b) < 0 && a % b); }
bool isect(iterator x, iterator y) {
if (y == end()) { x->p = inf; return false; }
if (x->k == y->k) x->p = x->m > y->m ? inf : -inf;
else x->p = div(y->m - x->m, x->k - y->k);
return x->p >= y->p;
}
void add(ll k, ll m) {
auto z = insert({k, m, 0}), y = z++, x = y;
while (isect(y, z)) z = erase(z);
if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
while ((y = x) != begin() && (--x)->p >= y->p)
isect(x, erase(y));
}
ll query(ll x) {
assert(!empty());
auto l = *lower_bound(x);
return l.k * x + l.m;
}
};
vi ans;
int32_t main()
{
BOOST;
int n,k;
cin>>n>>k;
for (int i=1;i<=n;i++)cin>>tab[i];
for (int i=1;i<=n;i++)pref[i]=pref[i-1]+tab[i];
for (int i=1;i<=k;i++)
{
LineContainer L;
for (int j=2;j<=n;j++)
{
L.add(pref[j-1],-(ll)pref[j-1]*pref[j-1]+dp[i-1][j-1]);
dp[i][j]=L.query(pref[j]);
}
}
/*
for (int i=1;i<=k;i++)
for (int j=1;j<=n;j++)
for (int l=j;l>=2;l--)
dp[i][j]=max(dp[i][j],prefix(l,j)*prefix(1,l-1)+dp[i-1][l-1]);
*/
cout<<dp[k][n]<<"\n";
int wsk=n;
for (int i=k;i>=1;i--)
for (int j=wsk;j>=2;j--)
if (dp[i][wsk]==prefix(j,wsk)*prefix(1,j-1)+dp[i-1][j-1])
{
wsk=j-1;
ans.pb(j-1);
break;
}
for (auto it:ans)cout<<it<<" ";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
436 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
10 ms |
1792 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
8 ms |
1408 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
10 ms |
1664 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
10 ms |
1792 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
6 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
33 ms |
3064 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
33 ms |
3064 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
29 ms |
2680 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
34 ms |
3064 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
33 ms |
3068 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
11 ms |
896 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
17 ms |
1408 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
1152 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
11 ms |
1280 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
514 ms |
17784 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
17 ms |
1408 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
222 ms |
11128 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
241 ms |
12668 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
297 ms |
13816 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
257 ms |
11256 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
266 ms |
12792 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
339 ms |
16120 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
95 ms |
8824 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
91 ms |
9208 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Execution timed out |
2017 ms |
54392 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
