#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
using namespace std;
const ll N = 1E5 + 10;
ll n, k;
ll a[N];
ll dp[N][2];
int pr[N][203];
ll j = 1;
void dac(ll l, ll r, ll L, ll R) {
if(l > r)return;
ll m = (l + r) >> 1ll;
for(int i = L; i <= min(R, m); i++) {
if(dp[m][1] <= dp[i - 1][0] + (a[m] - a[i - 1]) * a[i - 1])
dp[m][1] = dp[i - 1][0] + (a[m] - a[i - 1]) * a[i - 1],
pr[m][j] = i;
}
dac(l, m - 1, L, pr[m][j]);
dac(m + 1, r, pr[m][j], R);
}
int main() {
speed;
cin >> n >> k;
for(int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
for(int p = 1; p <= k; p++) {
j = p;
dac(1, n, 1, n);
for(int i = 1; i <= n; i++)
dp[i][0] = dp[i][1], dp[i][1] = 0;
}
/*for(int j = 1; j <= n; j++) {
for(int p = k; p >= 1; p--) {
for(int i = j; i > p; i--) {
if(dp[j][p] < dp[i - 1][p - 1] + (a[j] - a[i - 1]) * a[i - 1])
dp[j][p] = max(dp[j][p], dp[i - 1][p - 1] + (a[j] - a[i - 1]) * a[i - 1]),
pr[j][p] = i;
}
}
}*/
cout << dp[n][0] << '\n';
vector<ll> vost;
ll x = n, y = k;
while(y) {
x = pr[x][y];
y--;
vost.pb(x);
x--;
}
reverse(vost.begin(), vost.end());
for(auto u : vost)
cout << u - 1 << " ";
}
/*
7 3
4 1 3 4 0 2 3
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
460 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
456 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
460 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
460 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
460 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
1152 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
1100 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1100 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
1100 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
1100 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1100 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1148 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
8396 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
8392 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
97 ms |
8488 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
8396 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
67 ms |
8492 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
72 ms |
8488 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
95 ms |
8396 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
67 ms |
8396 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
65 ms |
8396 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
96 ms |
8484 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
64 ms |
82064 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
62 ms |
81988 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1873 ms |
82100 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
78 ms |
82096 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1945 ms |
82104 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1316 ms |
82372 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1480 ms |
82580 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
1164 ms |
82476 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1321 ms |
82452 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1651 ms |
82452 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
