#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef long double ld;
const ll INF = numeric_limits<ll>::max();
struct Line {
ll k, m;
int id;
ll f(const ll &x) { return k * x + m; }
bool operator< (const Line &oth) {
return mp(k, m) < mp(oth.k, oth.m);
}
};
struct cvh {
int ptr = 0;
vector<Line> hull;
void reset() { ptr = 0; hull.clear(); }
inline int sz() { return hull.size(); }
bool bad(const Line &a, const Line &b, const Line &c) {
if(b.k == c.k && b.m <= c.m) return true;
return (ld) (a.m - b.m) / (ld) (b.k - a.k) >= (ld) (b.m - c.m) / (ld) (c.k - b.k);
}
void add(ll k, ll m, int id) {
Line newline = {k, m, id};
while(sz() >= 2 && bad(hull[sz() - 2], hull[sz() - 1], newline)) hull.pop_back();
hull.pb(newline);
}
Line query(ll x) {
if(!sz()) {
Line amogus = {-INF, -INF, -1};
return amogus;
}
if(ptr >= sz())
ptr = sz() - 1;
while(ptr + 1 < sz() && hull[ptr].f(x) <= hull[ptr + 1].f(x)) ptr++;
return hull[ptr];
}
} Cvh;
const int maxN = 1e5 + 5, maxK = 205;
int n, k;
int trace[maxK][maxN];
ll a[maxN], dp[maxN];
signed main() {
cin >> n >> k;
for(int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
dp[0] = -INF;
for(int i = 2; i <= k + 1; i++) {
Cvh.reset();
for(int j = 1; j <= n; j++) {
Line best = Cvh.query(a[j]);
if(dp[j] != -INF)
Cvh.add(a[j], dp[j] - a[j] * a[j], j);
trace[i][j] = best.id;
if(best.id != -1)
dp[j] = best.f(a[j]);
else
dp[j] = -INF;
}
// cout << i << '\n';
// for(int j = 1; j <= n; j++)
// cout << dp[j] << ' ';
// cout << '\n';
}
cout << dp[n] << '\n';
vector<int> ans;
for(int i = k + 1, cur = n; i; i--) {
ans.pb(trace[i][cur]);
cur = trace[i][cur];
}
for(int i = (int)ans.size() - 1; i >= 0; i--)
if(ans[i]) cout << ans[i] << ' ';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
300 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
296 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1196 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1324 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
2096 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
1996 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
1796 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
2072 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
1996 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
716 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
972 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
908 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
908 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
58 ms |
9536 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
1036 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
43 ms |
6024 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
48 ms |
6916 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
52 ms |
7468 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
39 ms |
6176 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
44 ms |
6964 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
56 ms |
8656 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
5176 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
31 ms |
5464 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
570 ms |
83140 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
39 ms |
5940 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
674 ms |
82536 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
460 ms |
58808 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
507 ms |
63532 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
396 ms |
52524 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
420 ms |
59316 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
538 ms |
74888 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
