#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
const int MAX = 1e3 + 5;
namespace CH {
struct rect {
int64 n, m;
int id;
rect() {}
rect(int64 n, int64 m, int id) : n(n), m(m), id(id) {}
int64 eval(int64 x) {
return m * x + n;
}
};
int k, opt;
rect stk[MAX];
void init() {
k = 0, opt = 1;
}
bool bad_line(rect l1, rect l2, rect l3) {
return (l1.n - l3.n) * (l2.m - l1.m) < (l3.m - l1.m) * (l1.n - l2.n);
}
void add(rect r) {
while(k > 1 && bad_line(stk[k - 1], stk[k], r))
k--;
stk[++k] = r;
}
pair <int64, int> query(int64 x) {
if(k == 0)
return { -1, -1 };
if(opt > k)
opt = k;
while(opt < k && stk[opt].eval(x) <= stk[opt + 1].eval(x))
opt++;
return { stk[opt].eval(x), stk[opt].id };
}
}
int n, k;
pair <int, int> p[MAX][205];
int64 t[MAX], dp[MAX][205];
vector <int64> ans;
int main() {
scanf("%d%d", &n, &k);
k++;
for(int i = 1; i <= n; i++) {
int x; scanf("%d", &x);
t[i] = t[i - 1] + x;
}
memset(dp, -1, sizeof(dp));
dp[0][0] = 0;
for(int l = 1; l <= k; l++) {
CH::init();
for(int i = 1; i <= n; i++) {
if(dp[i - 1][l - 1] != -1)
CH::add(CH::rect(dp[i - 1][l - 1] - t[i - 1] * t[i - 1], t[i - 1], i - 1));
auto o = CH::query(2LL * t[i] - t[n]);
dp[i][l] = o.first;
if(dp[i][l] != -1) {
dp[i][l] += t[i] * t[n] - t[i] * t[i];
p[i][l] = { o.second, l - 1 };
}
}
}
printf("%lld\n", dp[n][k] / 2);
int x = n, y = k;
while(1) {
if(x == 0)
break;
ans.push_back(x);
int nx = p[x][y].first;
int ny = p[x][y].second;
x = nx, y = ny;
}
reverse(ans.begin(), ans.end());
ans.pop_back();
for(int i = 0; i < (int) ans.size(); i++) {
printf("%lld", ans[i]);
printf(i == (int) ans.size() - 1 ? "\n" : " ");
}
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:58:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &k);
^
sequence.cpp:63:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
int x; scanf("%d", &x);
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
5268 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
5268 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
5268 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Incorrect |
6 ms |
5268 KB |
contestant didn't find the optimal answer: 4699030135 < 4699030287 |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
0 ms |
5268 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
6 ms |
5268 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
