#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const ll inf = 1e18;
ll a[maxn], par[maxn], dp[maxn];
int m[210][maxn];
struct line{
ll a; // shib
ll b; // arz az mabda
int idx;
line(ll a_ = 0, ll b_ = 0, int idx_ = 1){
a = a_, b = b_, idx = idx_;
}
ll gety(ll x){
return a * x + b;
}
};
stack<line> Q;
bool isgood(line fi, line se, line th){
// return 1ll * (se.b - fi.b) * (fi.a - th.a) < 1ll * (th.b - fi.b) * (fi.a - se.a);
return 1. * (se.b - fi.b) / (fi.a - se.a) < 1. * (th.b - fi.b) / (fi.a - th.a);
}
bool parallel(line fi, line se){
return fi.a == se.a;
}
void add(ll a, ll b, int idx){ // y = ax + b
line nw = line(a, b, idx);
if (!Q.empty() and parallel(nw, Q.top())){
if (b > Q.top().b)
Q.pop();
else
return;
}
while (Q.size() > 1){
line nex = Q.top();
Q.pop();
line other = Q.top();
if (isgood(other, nex, nw)){
Q.push(nex);
break;
}
}
Q.push(nw);
}
pair<ll, int> get(ll x, int idx){
while (!Q.empty() and Q.top().idx >= idx)
Q.pop();
if (Q.empty())
return {-inf, 0};
while (Q.size() > 1){
line nw = Q.top();
Q.pop();
if (nw.gety(x) > Q.top().gety(x)){
Q.push(nw);
break;
}
}
// cout << x << " -> " << Q.top().a << " " << Q.front().b << " " << Q.front().idx << endl;
return {Q.top().gety(x), Q.top().idx};
}
void vitex(){
while (!Q.empty())
Q.pop();
}
int main(){
ios_base::sync_with_stdio (false);
int n, k;
cin >> n >> k;
k ++;
for (int i = 1; i <= n; i++){
cin >> a[i];
par[i] = par[i - 1] + a[i];
}
for (int i = 1; i <= k; i++){
for (int j = n; j >= 1; j--){
if (i == 1){
dp[j] = 0;
continue;
}
auto it = get(par[j], j);
dp[j] = it.first;
m[i][j] = it.second;
}
vitex();
for (int j = 1; j <= n; j++)
add(par[j], dp[j] - par[j] * par[j], j);
}
cout << dp[n] << endl;
int p = k, q = n;
while (p > 1){
cout << m[p][q] << " ";
q = m[p][q];
p --;
}
cout << endl;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
380 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
4 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
4 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1536 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
2092 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
2176 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
1920 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
15 ms |
2176 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
12 ms |
2176 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
5 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
896 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
896 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
86 ms |
9564 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
1024 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
73 ms |
6064 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
74 ms |
6840 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
77 ms |
7288 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
74 ms |
6184 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
69 ms |
6904 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
103 ms |
8696 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
29 ms |
5836 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
30 ms |
5732 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1160 ms |
83604 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
29 ms |
6284 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1190 ms |
83128 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
837 ms |
59600 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
821 ms |
63816 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
707 ms |
52884 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
717 ms |
59908 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
903 ms |
75604 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
