#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
const int maxk = 205;
const long long inf = (1LL << 63) - 1;
int n, k;
long long a[maxn];
long long pref[maxn];
long long dp[2][maxn];
int prvState[maxn][maxk];
long long sum(int from, int to)
{
return pref[to] - pref[from - 1];
}
struct Line
{
long long a;
long long b;
int idx;
long long calc(long long x)
{
return a * x + b;
}
};
struct ConvexHullTrickMAX
{
vector<pair<Line, double>> upperEnvelope;
void reset()
{
upperEnvelope.clear();
}
double cross(const Line& l1, const Line& l2)
{
return (1.0 * (l1.b - l2.b)) / (1.0 * (l2.a - l1.a));
}
bool toRemove(const Line& newLine, pair<Line, double> last)
{
if (newLine.a == last.first.a)
{
return newLine.b >= last.first.b;
}
return cross(newLine, last.first) <= last.second;
}
void addLine(Line newLine)
{
while (upperEnvelope.size() > 1 && toRemove(newLine, upperEnvelope.back()) == true)
{
upperEnvelope.pop_back();
}
if (upperEnvelope.empty())
{
upperEnvelope.push_back({newLine, -inf});
}
else
{
upperEnvelope.push_back({newLine, cross(newLine, upperEnvelope.back().first)});
}
}
Line query(long long x)
{
/*cout << "now query " << x << endl;
for (auto [line, point] : upperEnvelope)
{
cout << line.idx << " " << point << endl;
}*/
int l = 0;
int r = upperEnvelope.size() - 1;
while (l <= r)
{
int mid = (l + r) / 2;
if (upperEnvelope[mid].second <= 1.0 * x)
{
l = mid + 1;
}
else
{
r = mid - 1;
}
}
return upperEnvelope[r].first;
}
};
ConvexHullTrickMAX cht[2];
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main()
{
fastIO();
cin >> n >> k;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
for (int j = 1; j <= k; ++j)
{
int curr = (j & 1);
int prv = 1 - curr;
cht[prv].reset();
for (int i = j; i <= n; ++i)
{
if (i > j)
{
Line best = cht[prv].query(pref[i]);
dp[curr][i] = best.calc(pref[i]);
prvState[i][j] = best.idx;
}
cht[prv].addLine({pref[i], dp[prv][i] - pref[i] * pref[i], i});
}
}
long long ans = dp[(k & 1)][n];
int pos = n;
stack<int> splits;
while (k > 0)
{
splits.push(prvState[pos][k]);
pos = splits.top();
--k;
}
cout << ans << endl;
while (!splits.empty())
{
cout << splits.top() << " ";
splits.pop();
}
cout << endl;
return 0;
}
/*
6 1
0 0 0 0 1 1
7 3
4 1 3 4 0 2 3
2 1 4
3 1 16
3 2 19
4 1 35
4 2 48
4 3 51
5 1 35
5 2 48
5 3 51
6 1 48
6 2 64
6 3 72
7 1 72
7 2 95
7 3 108
*/
Compilation message
sequence.cpp:7:35: warning: integer overflow in expression of type 'long long int' results in '9223372036854775807' [-Woverflow]
7 | const long long inf = (1LL << 63) - 1;
| ~~~~~~~~~~~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Incorrect |
0 ms |
348 KB |
contestant didn't find the optimal answer: 0 < 1 |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
432 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
604 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
604 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Incorrect |
1 ms |
604 KB |
contestant didn't find the optimal answer: 1019625817 < 1019625819 |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1368 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
1372 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
1368 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
5 ms |
1372 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
5 ms |
1372 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
1372 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1372 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1372 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
9440 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
9440 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
43 ms |
9692 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
9948 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
40 ms |
9440 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
49 ms |
9440 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
48 ms |
9776 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
52 ms |
9948 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
37 ms |
9688 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
48 ms |
9692 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
45 ms |
92356 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
47 ms |
92356 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
490 ms |
93156 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
52 ms |
93120 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
636 ms |
92608 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
607 ms |
90564 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
528 ms |
93124 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
513 ms |
93124 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
395 ms |
92868 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
486 ms |
92868 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
