#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<ll, ll> pi;
typedef pair<pi, int> pii;
#define f first
#define s second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define all(v) v.begin(), v.end()
#define INF (int) 1e9 + 100
#define LLINF (ll) 1e18
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int n, k, ans[205][100005], arr[100005];
ll ss[100005];
inline ll cut(int x, int y, int m) {
return (ss[y] - ss[m]) * (ss[m] - ss[x-1]);
}
deque <pii> dq;
pi func(pii line, ll x) {
return pi(line.f.f * x + line.f.s, line.s);
}
pi query(int x, int idx) { // Finds the maximum of a mathematical function
while (dq.size() > 1) {
if (dq[1].s > idx) break;
if (func(dq[0], x).f < func(dq[1], x).f) dq.pop_front();
else break;
}
return func(dq[0], x);
}
double intersect(ll m1, ll c1, ll m2, ll c2) {
return (double) (c1 - c2) / (double) (m2 - m1);
}
double intersect(pii p1, pii p2) {
return intersect(p1.f.f, p1.f.s, p2.f.f, p2.f.s);
}
void insertline(ll m, ll c, int idx) { // y = mx + c
pii line = pii(pi(m, c), idx);
while (dq.size() > 1) { // To prevent seg fault
ll si = dq.size();
if (intersect(dq[si - 1], line) <= intersect(dq[si - 2], line)) { // Criteria for useless line: intersect 2 <= intersect 1
dq.pop_back(); // Remove useless line
} else break;
}
dq.push_back(line);
}
int main() {
fastio; cin >> n >> k;
FOR(i, 1, n) {
cin >> arr[i];
ss[i] = ss[i-1] + arr[i];
}
FOR(i, 0, k) {
vpii toadd;
FOR(j, i+1, n) {
ll res;
if (i == 0 or j == 1) res = 0;
else {
pi t = query(ss[j], j);
res = t.f;
ans[i][j] = t.s;
}
toadd.pb(pii(pi(ss[j], res - ss[j] * ss[j]), j));
if (i == k and j == n) cout << res << "\n";
}
dq.clear();
for(auto it:toadd) insertline(it.f.f, it.f.s, it.s);
}
DEC(i, k, 1) {
cout << ans[i][n] << " ";
n = ans[i][n];
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
396 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
12 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
2176 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
14 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
12 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
1456 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
1408 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
154 ms |
10012 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
1584 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
109 ms |
6644 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
128 ms |
7352 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
129 ms |
7824 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
101 ms |
6676 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
120 ms |
7476 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
151 ms |
9324 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
45 ms |
9992 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
43 ms |
10160 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1693 ms |
88532 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
43 ms |
11268 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1895 ms |
87524 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1004 ms |
63696 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1387 ms |
68864 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
1122 ms |
57668 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1279 ms |
64672 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1620 ms |
80300 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
