/*
*/
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <random>
#include <queue>
#include <bitset>
// #define int long long
#define ll long long
#define ld long double
#define pb push_back
#define str string
using namespace std;
const int M = 998244353;
ll dp[100009];
int par[100009][209];
int zzz;
ld intersec(pair<pair<ll, ll>, int> w1, pair<pair<ll, ll>, int> w2) {
ld k1 = w1.first.first, b1 = w1.first.second;
ld k2 = w2.first.first, b2 = w2.first.second;
ld x = (b2 - b1) / (k1 - k2);
return x;
}
vector<pair<pair<ll, ll>, int>> s;
void add_line(ll k, ll b, int index) {
while (s.size() >= 2) {
ld x1 = intersec(s[s.size() - 2], s[s.size() - 1]);
ld x2 = intersec(s[s.size() - 2], {{k, b}, index});
if (x1 >= x2) {
s.pop_back();
} else {
break;
}
}
s.pb({{k, b}, index});
}
pair<ll, int> my_lower_bound(ll h) {
int left = zzz;
int right = (int) s.size();
int f = 0;
for (int mid = left + 1; mid < right; mid++) {
ld lol = intersec(s[mid - 1], s[mid]);
if (lol >= h) {
left = mid - 1;
f = 1;
break;
}
}
if (f == 0) left = s.size() - 1;
zzz = left;
return {h * s[left].first.first + s[left].first.second, s[left].second};
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, k;
cin >> n >> k;
vector<ll> A(n + 1);
for (int i = 1; i <= n; i++) cin >> A[i];
vector<ll> pref = A;
for (int i = 1; i <= n; i++) pref[i] += pref[i - 1];
for (int i = 1; i <= n; i++) {
dp[i] = 0;
}
for (int t = 1; t <= k; t++) {
add_line(pref[t], dp[t] - pref[t] * pref[t], t);
zzz = 0;
for (int i = t + 1; i <= n; i++) {
pair<ll, int> kek = my_lower_bound(pref[i]);
add_line(pref[i], dp[i] - pref[i] * pref[i], i);
dp[i] = kek.first;
par[i][t] = kek.second;
}
s = {};
}
cout << dp[n] << '\n';
int i = n;
int t = k;
vector<ll> ans;
while (t >= 1) {
cout << par[i][t] << ' ';
i = par[i][t];
t--;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 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 |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
4 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 |
4 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
4 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 |
5 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 |
4 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
4 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 |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
512 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
10 ms |
1280 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
1280 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
1280 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
1280 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
1280 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
1280 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
1280 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
9024 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
10 ms |
9024 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
66 ms |
9212 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
9212 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
59 ms |
9152 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
63 ms |
9152 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
70 ms |
9340 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
47 ms |
9212 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
54 ms |
9116 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
68 ms |
9200 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
57 ms |
86504 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
59 ms |
86760 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
627 ms |
87652 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
58 ms |
87528 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
921 ms |
86892 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
622 ms |
86760 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
665 ms |
87528 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
479 ms |
87396 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
538 ms |
87400 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
682 ms |
87272 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
