#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef long double ld;
const int maxn = 1e5+5, maxk = 205;
int N, K, a[maxn];
ll pre[maxn];
ll dp[maxn][maxk];
int previous[maxn][maxk];
struct FN
{
int id;
ll m, b; //in this case, function is a line
FN(ll _m, ll _b, int _id) : m(_m), b(_b), id(_id) {}
ll eval(ll x) const {
return m*x + b;
}
ld intersect(const FN& r) const { //returns x coordinate of intersection
//assert(m != r.m);
return (ld)(r.b-b)/(ld)(m-r.m);
}
friend bool comp(const FN& l1, const FN& l2, const FN& l) {
//order in deque: l1, l2, l
//true --> l2 is unnecessary
ld x1 = l1.intersect(l);
ld x2 = l1.intersect(l2);
return x1 <= x2;
}
};
struct Hull: public deque<FN> //convex hull for maximum
{
void add(const FN& l) {
//slopes coming in -1,-2,-3,...so add to front of deque rather than back (querying for maximum)
//if adding to back, need to change the indices
while (!empty() && back().m == l.m) {
assert(back().b <= l.b);
pop_back();
}
while (size() >= 2 &&
comp(*prev(rbegin()),*rbegin(),l)) {
pop_back();
}
while (!empty() && back().m == l.m) {
assert(back().b <= l.b);
pop_back();
}
if (!empty() && back().m == l.m) {
pop_back();
}
if (!empty()) assert(back().m != l.m);
push_front(l);
/*
if (size() >= 2) {
assert(prev(rbegin())->m != (*rbegin()).m);
}
*/
}
pair<ll,int> query(ll x) {
/*
while (size() >= 2 && begin()->eval(x) <= next(begin())->eval(x)) {
pop_front();
}
return {begin()->eval(x),begin()->id};
*/
pair<ll,int> best = {0,0};
for (auto it = begin(); it != end(); ++it) {
best = max(best,{it->eval(x),it->id});
}
return best;
}
} hulls[maxk];
int main()
{
//ios_base::sync_with_stdio(false); cin.tie(NULL);
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> a[i];
pre[i] = a[i] + pre[i-1];
}
for (int i = 1; i <= N; i++) {
for (int k = 1; k <= K; k++) {
//if (i-1 == 0 || pre[i-1] > pre[i-2] ||
// (pre[i-1] == pre[i-2] &&
// dp[i-1][k-1] > dp[i-2][k-1])) {
hulls[k-1].add(FN(pre[i-1],dp[i-1][k-1]-pre[i-1]*pre[i-1],i-1));
//}
//else cout << "discounted " << (i-1) << ' ' << (k-1) << '\n';
auto p = hulls[k-1].query(pre[i]);
dp[i][k] = p.first;
previous[i][k] = p.second;
//printf("[%d][%d]: %d\n",i,k,dp[i][k]);
}
}
//output
cout << dp[N][K] << '\n';
int curr = N;
int k = K;
vector<int> ans;
while (k > 0) {
curr = previous[curr][k];
k--;
ans.push_back(curr);
}
reverse(ans.begin(),ans.end());
for (int i: ans) {
cout << i << ' ';
}
cout << '\n';
}
Compilation message
sequence.cpp: In constructor 'FN::FN(ll, ll, int)':
sequence.cpp:15:11: warning: 'FN::b' will be initialized after [-Wreorder]
ll m, b; //in this case, function is a line
^
sequence.cpp:14:9: warning: 'int FN::id' [-Wreorder]
int id;
^~
sequence.cpp:16:5: warning: when initialized here [-Wreorder]
FN(ll _m, ll _b, int _id) : m(_m), b(_b), id(_id) {}
^~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
2 ms |
508 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
3 ms |
632 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
3 ms |
632 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
3 ms |
632 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
3 ms |
632 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
1016 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
3 ms |
1016 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
21 ms |
2168 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
3 ms |
888 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
15 ms |
1656 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
19 ms |
1912 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
21 ms |
2040 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
7 ms |
1144 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
5 ms |
1116 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
8 ms |
1272 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
9 ms |
2936 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
8 ms |
2936 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
336 ms |
8064 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
8 ms |
2936 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
312 ms |
7900 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
261 ms |
7160 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
314 ms |
7928 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
304 ms |
7928 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
65 ms |
3960 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
127 ms |
4984 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
493 ms |
25584 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
705 ms |
25464 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Execution timed out |
2048 ms |
18852 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2033 ms |
49972 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |