#include <bits/stdc++.h>
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using vi = vector<int>;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lb lower_bound
/// #define int ll
/// #define double ld
const int MOD = 1000 * 1000 * 1000 + 7;
const double EPS = 1e-9;
int N, K;
ll A[100001], DP[2][100001];
int P[201][100001], Q[100001];
ll area(int a, int b, int c) {
return (DP[0][b] - DP[0][a]) - (A[b] - A[a]) * (A[N] - A[c]);
}
ll cross(int a, int b, int c) {
return (DP[0][b] - DP[0][a]) * (A[c] - A[b])
- (DP[0][c] - DP[0][b]) * (A[b] - A[a]);
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> N >> K;
for(int l = 1; l <= N; l++) {
cin >> A[l];
A[l] += A[l - 1];
}
for(int l = 1; l <= K; l++) {
int L = 1, R = 1; Q[R++] = 0;
for(int i = 1; i <= N; i++) {
while(R - L > 1 && area(Q[L], Q[L + 1], i) >= 0) L++;
int V = Q[L];
DP[1][i] = DP[0][V] + (A[i] - A[V]) * (A[N] - A[i]);
P[l][i] = V;
while(R - L > 1 && cross(Q[R - 2], Q[R - 1], i) <= 0) R--;
Q[R++] = i;
}
swap(DP[0], DP[1]);
}
ll res = -1; int curr = 0;
for(int l = 1; l <= N; l++) {
if(DP[0][l] > res)
res = DP[0][l], curr = l;
}
cout << res << "\n";
while(K > 0) {
cout << curr << " ";
curr = P[K][curr]; K--;
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
2136 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
3 ms |
1924 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
4 ms |
1928 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
1876 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
1896 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
19 ms |
2900 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
14 ms |
2580 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
17 ms |
2772 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
20 ms |
2884 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
2116 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
4 ms |
2004 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
7 ms |
2280 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
22 ms |
3548 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
24 ms |
3580 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
21 ms |
3276 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
22 ms |
3596 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
23 ms |
3620 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
8 ms |
2244 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
10 ms |
2568 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2136 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
2132 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
47 ms |
10732 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
2132 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
53 ms |
7220 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
50 ms |
8132 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
42 ms |
8488 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
33 ms |
7364 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
35 ms |
8092 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
46 ms |
9844 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
4088 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
14 ms |
4052 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
315 ms |
81804 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
12 ms |
4724 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
458 ms |
81352 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
340 ms |
57944 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
364 ms |
62220 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
235 ms |
51096 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
245 ms |
58164 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
347 ms |
73736 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
