#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> void check_min(T &a, const T &b){ a = (a < b) ? a : b; }
template<class T> void check_max(T &a, const T &b){ a = (a > b) ? a : b; }
#define a__int128(x) (x).begin(), (x).end()
struct CHT{
struct Line{
__int128 first, second;
int index;
Line(__int128 first, __int128 second, int index): first(first), second(second), index(index){}
};
deque<Line> lines;
__int128 floor_div3(__int128 a, __int128 b) {
__int128 d = a / b;
return d * b == a ? d : d - ((a < 0) ^ (b < 0));
}
__int128 ip(Line l1, Line l2){
__int128 a = l1.second - l2.second;
__int128 b = l2.first - l1.first;
return a / b;
}
__int128 eval(Line l, __int128 x){
return l.first * x + l.second;
}
void add(__int128 k, __int128 b, __int128 index){
while(!lines.empty() && k == lines.back().first){
if(lines.back().second <= b)
lines.pop_back();
else
return;
}
while(lines.size() >= 2 && ip(lines[lines.size() - 2], lines.back()) >= ip(lines.back(), Line(k, b, 0)))
lines.pop_back();
lines.push_back(Line(k, b, index));
}
pair<__int128, int> query(__int128 x){
while(lines.size() >= 2 && eval(lines[0], x) <= eval(lines[1], x))
lines.pop_front();
return {eval(lines.front(), x), lines.front().index};
}
};
const int N = 1e5 + 3;
const int K = 200 + 3;
const __int128 INF = 4e18;
__int128 p[N];
ll a[N], n, k;
__int128 dp[2][N];
int pr[K][N];
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
++k;
for(int i = 1; i <= n; ++i)
cin >> a[i];
for(int i = 1; i <= n; ++i)
p[i] = p[i - 1] + a[i];
for(int i = 1; i <= n; ++i)
dp[0][i] = -INF;
dp[0][n + 1] = 0;
for(int j = 1; j <= k; ++j){
CHT cht;
for(int i = n; i >= 1; --i){
cht.add(-p[i], -p[i] * p[i] + p[i] * p[n] + dp[(j - 1) & 1][i + 1], i);
auto q = cht.query(-p[i - 1]);
dp[j & 1][i] = q.first - p[i - 1] * p[n];
pr[j][i] = q.second;
}
dp[j & 1][n + 1] = -INF;
}
cout << (ll)dp[k & 1][1] << "\n";
int pos = 1;
while(k > 1){
int index = pr[k][pos];
cout << index << " ";
pos = index + 1;
--k;
}
cout << "\n";
}
/*
7 3
4 1 3 4 0 2 3
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 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 |
340 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 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 |
0 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 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
596 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 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 |
1 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
1364 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1052 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1236 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1364 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
596 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 |
596 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
13 ms |
2148 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
15 ms |
2176 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
1876 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
16 ms |
2100 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
12 ms |
2172 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
724 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
1108 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
1364 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
1236 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
124 ms |
9728 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
1236 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
84 ms |
6304 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
89 ms |
7116 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
96 ms |
7720 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
85 ms |
6320 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
88 ms |
7288 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
105 ms |
8888 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
29 ms |
8788 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
42 ms |
8516 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1200 ms |
84828 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
30 ms |
9044 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1306 ms |
85216 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
859 ms |
61156 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
949 ms |
64976 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
798 ms |
54116 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
849 ms |
61288 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1130 ms |
77084 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
