/// In The Name Of God
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)1e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
int get_int() {
char x = getchar();
while (!isdigit(x)) x = getchar();
int res = 0;
while (isdigit(x)) res = res * 10 + x - '0', x = getchar();
return res;
}
void out(int x) {
if (x > 9) out(x / 10);
putchar(x % 10 + '0');
}
struct line {
int k, id;
ll b;
line() {}
line(int k, ll b, int id) : k(k), b(b), id(id) {}
ll get(int x) {
return (ll)k * x + b;
}
};
struct cht {
int ptr, sz;
line v[N];
inline double inter(line &a, line &b) {
return (b.b - a.b) / (double)(a.k - b.k);
}
inline void add(line x) {
/*int l = 2, r = sz, res = sz;
while (l <= r) {
int mid = l + r >> 1;
if (inter(v[mid - 1], x) <= inter(v[mid - 1], v[mid])) res = mid - 1, r = mid - 1;
else l = mid + 1;
}
sz = res;*/
while (sz > 1 && inter(v[sz - 1], x) <= inter(v[sz - 1], v[sz])) --sz;
v[++sz] = x;
}
inline line get(ll x) {
ptr = min(ptr, sz);
while (ptr < sz && v[ptr].get(x) <= v[ptr + 1].get(x)) ptr++;
return v[ptr];
}
void clear() {
sz = 0;
ptr = 1;
}
} t;
int n, k;
int a[N], s[N], p[N];
int now;
ll dp[2][N];
int opt[201][N];
bool upd(ll &x, ll y) {
if (x < y) {
x = y;
return 1;
}
return 0;
}
int main() {
#ifdef IOI2018
freopen ("in.txt", "r", stdin);
#endif
n = get_int(), k = get_int();
for (int i = 1; i <= n; i++) {
a[i] = get_int();
s[i] = a[i];
p[i] = p[i - 1] + a[i];
}
for (int i = n; i >= 1; i--) {
s[i] += s[i + 1];
}
for (int i = 1, p = 0; i <= n; i++) {
p += a[i];
dp[now][i] = (ll)p * s[i + 1];
}
for (int o = 2; o <= k; o++) {
t.clear();
int nxt = now ^ 1;
for (int i = o - 1; i <= n; i++) {
t.add({p[i - 1], dp[now][i - 1], i});
line res = t.get(-s[i + 1]);
opt[o][i] = res.id;
dp[nxt][i] = res.get(-s[i + 1]) + (ll)p[i] * s[i + 1];
}
now ^= 1;
}
ll ans = -linf;
int ptr = -1;
for (int i = 1; i < n; i++) {
if (upd(ans, dp[now][i])) {
ptr = i;
}
}
printf ("%lld\n", ans);
vector <int> res;
for (int i = k; i >= 1; i--) {
res.pb(ptr);
ptr = opt[i][ptr] - 1;
}
reverse(all(res));
for (auto it : res) {
out(it);
putchar(' ');
}
ioi
}
Compilation message
sequence.cpp: In constructor 'line::line(int, ll, int)':
sequence.cpp:52:5: warning: 'line::b' will be initialized after [-Wreorder]
ll b;
^
sequence.cpp:51:9: warning: 'int line::id' [-Wreorder]
int k, id;
^~
sequence.cpp:54:2: warning: when initialized here [-Wreorder]
line(int k, ll b, int id) : k(k), b(b), id(id) {}
^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
3 ms |
460 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
2 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 |
2 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
4 ms |
1024 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
4 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 |
3 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
7 ms |
1964 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
7 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
6 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
5 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
5 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
896 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
35 ms |
9476 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
3 ms |
896 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
33 ms |
5880 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
40 ms |
6776 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
39 ms |
7288 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
32 ms |
6136 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
32 ms |
6748 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
53 ms |
8568 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
5120 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
11 ms |
5120 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
297 ms |
82492 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
16 ms |
5504 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
498 ms |
82424 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
313 ms |
58744 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
396 ms |
63096 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
261 ms |
52012 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
312 ms |
58940 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
400 ms |
74580 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |