#include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define pii pair<int, int>
typedef long long ll;
using namespace std;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int OFF = (1 << 20);
int n, k;
int a[100005];
ll p[100005];
ll dp[100005][2];
int gdje[100005][205];
vector< pair<int, int> > v;
int kreni;
void rek(int x, int y) {
if (y == 0) return;
cout << x << " ";
rek(gdje[x][y], y-1);
}
int ccw(pair<ll, ll> p1, pair<ll, ll> p2, pair<ll, ll> p3) {
ll out = p1.X * (p2.Y - p3.Y) + p2.X * (p3.Y - p1.Y) + p3.X * (p1.Y - p2.Y);
if (out > 0) return 1;
if (out == 0) return 0;
if (out < 0) return -1;
}
pair<ll, ll> cord(int x, int y) {
return {p[x], dp[x][0]-p[x]*p[x]};
}
ll val(int x, int y, ll tren) {
return dp[x][0]-p[x]*p[x]+p[x]*tren;
}
void dodaj(int x, int y) {
if (v.size() == 0) {
v.push_back({x, y});
return;
}
pair<int, int> z = v.back();
v.pop_back();
while ((int)v.size() > 0 && ccw(cord(v.back().X, v.back().Y), cord(z.X, z.Y), cord(x, y)) >= 0) {
z = v.back();
v.pop_back();
}
v.push_back(z);
v.push_back({x, y});
}
int query(int pref) {
int mid = kreni;
while (mid+1 < (int)v.size()) {
if (val(v[mid].X, v[mid].Y, pref) < val(v[mid+1].X, v[mid+1].Y, pref)) mid++;
else break;
}
kreni = mid;
return v[mid].X;
}
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
p[i] = p[i-1] + a[i];
}
for (int i = 2; i <= k+1; i++) {
for (int j = 1; j <= n; j++) {
if (dp[j][0] != -INF) dodaj(j, i-1);
}
kreni = 0;
for (int j = 1; j <= n; j++) {
int pos = query(p[j]);
pos = min(pos, j-1);
gdje[j][i] = pos;
if (dp[pos][0] == -INF) dp[j][1] = -INF;
else dp[j][1] = val(pos, i-1, p[j]);
if (pos < 1) dp[j][1] = -INF;
}
for (int j = 1; j <= n; j++) {
dp[j][0] = dp[j][1];
dp[j][1] = 0;
}
v.clear();
}
cout << dp[n][0] << "\n";
rek(gdje[n][k+1], k);
return 0;
}
Compilation message
sequence.cpp: In function 'int ccw(std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::pair<long long int, long long int>)':
sequence.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
34 | }
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
1108 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
1188 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1108 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
1108 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
1188 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1108 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1108 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
8660 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
8660 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
65 ms |
8788 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
8784 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
52 ms |
8756 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
56 ms |
8660 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
58 ms |
8788 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
48 ms |
8788 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
54 ms |
8836 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
64 ms |
8828 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
49 ms |
83988 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
48 ms |
84008 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
788 ms |
84160 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
48 ms |
84656 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
892 ms |
84208 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
651 ms |
84196 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
620 ms |
84776 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
519 ms |
84452 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
636 ms |
84424 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
710 ms |
84432 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
