#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
template<typename T>
string tostr(const T& value) {
ostringstream oss;
oss << value;
return oss.str();
}
template<typename... Args>
string fstr(const string& format, Args... args) {
string result = format;
size_t pos = 0;
size_t argIndex = 0;
auto replaceArg = [&](const auto& arg) {
pos = result.find("{}", pos);
if (pos != string::npos) {
result.replace(pos, 2, tostr(arg));
++argIndex;
}
};
(replaceArg(args), ...);
return result;
}
#define ll long long
const int maxn = 100000;
const int maxk = 200 + 1;
const ll INF = 2000000000'000000;
int n, k;
ll p[maxn+1];
ll dp[maxn+1][2];
int pre[maxn+1][maxk+1];
struct F {
ll a, b;
F() {}
F(ll A, ll B) { if (B < 0) B *= -1, A *= -1; a = A, b = B; }
bool operator<(F o) const { return a*o.b<b*o.a; }
bool operator<=(F o) const { return a*o.b<=b*o.a; }
};
struct L {
ll m, b; int i;
ll f(ll x) { return m*x+b; }
F operator*(L o) { if (m==o.m) return F{o.b, 1}; return F{o.b-b,m-o.m}; }
};
struct CHT {
deque<L> d;
inline void clear() { d.clear(); }
void add(L l) {
while (d.size() >= 2 && (d.end()[-2]*l) <= (d.end()[-2]*d.back())) d.pop_back();
d.push_back(l);
}
L qry(ll x) {
while (d.size() >= 2 && d[1].f(x) >= d[0].f(x)) d.pop_front();
return d[0];
}
};
signed main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) { cin >> p[i]; p[i] += p[i-1]; }
fill(dp[0] + (maxn+1), dp[0] + (maxn+1)*2, -INF);
fill(dp[0], dp[0] + (maxn+1), 0);
dp[0][0] = -INF;
for (int i = 1; i <= k; i++) {
CHT h;
dp[0][i&1] = -INF;
for (int j = 1; j <= n; j++) {
h.add(L{p[j-1], dp[j-1][!(i&1)] - p[j-1]*p[j-1], j-1});
L q = h.qry(p[j]);
dp[j][i&1] = max(q.f(p[j]), -INF);
pre[j][i] = q.i;
}
}
cout << dp[n][k & 1] << '\n';
int x = pre[n][k--];
while (k >= 0) {
cout << x << ' ';
x = pre[x][k--];
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
2004 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
2004 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
2644 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
4 ms |
2620 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
2644 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
5 ms |
2644 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
5 ms |
2644 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
5 ms |
2680 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
4 ms |
2644 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
2 ms |
2644 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
3 ms |
2644 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
9940 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
6 ms |
10008 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
38 ms |
9940 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
6 ms |
9940 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
33 ms |
9940 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
38 ms |
10100 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
38 ms |
9940 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
29 ms |
9928 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
35 ms |
9940 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
40 ms |
9940 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
46 ms |
82508 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
44 ms |
82716 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
416 ms |
82784 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
49 ms |
82892 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
527 ms |
82788 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
362 ms |
82604 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
426 ms |
82908 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
305 ms |
82884 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
331 ms |
82680 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
409 ms |
82764 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |