#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#define endl '\n'
#define pb push_back
#define fr first
#define sc second
#define ll long long int
#define ld long double
#define bit(idx) idx&(-idx)
#define bin(x) bitset<32>(x)
#define all(A) A.begin(), A.end()
#define de(x) cout << #x << " = " << x << endl;
#define row vector<ll>
#define row_matrix vector<ll>
#define matrix vector<row_matrix>
#define ordered_set_T int
using namespace std;
using namespace __gnu_pbds;
typedef tree<ordered_set_T, null_type, less<ordered_set_T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
/// find_by_order(x) -> x-th element in the set
/// order_of_key(x) -> how many elements are smaller than x
/// insert(x) -> inserts x into the set
const ll MAXN = 1e5 + 5;
const ll MAXK = 2e2 + 2;
const ll INF = 1e18 + 18;
int n, k, opt[MAXK][MAXN];
ll dp[MAXK][MAXN], A[MAXN], prefix[MAXN];
ll f(ll l, ll r){
return (l == 0 ? 0 : prefix[l - 1]) * (prefix[r] - (l == 0 ? 0 : prefix[l - 1]));
}
void solve(ll i, ll l, ll r, ll tl, ll tr){
if(l > r){
return;
}
ll m = (l + r) / 2;
for(ll t = tl; t <= min(m - 1, tr); t ++){
ll tmp = dp[(i - 1) % 2][t] + f(t + 1, m);
if(tmp > dp[i % 2][m]){
dp[i % 2][m] = tmp;
opt[i][m] = t;
}
}
solve(i, l, m - 1, tl, opt[i][m]);
solve(i, m + 1, r, opt[i][m], tr);
}
int main(){
/// ios_base::sync_with_stdio(false); cin.tie(NULL);
cin >> n >> k;
for(int i = 1; i <= n; i ++){
cin >> A[i];
prefix[i] = prefix[i - 1] + A[i];
}
for(int i = 1; i <= k; i ++){
for(int j = 0; j <= n; j ++) dp[i % 2][j] = -INF;
solve(i, i + 1, n, 1, n);
}
cout << dp[k % 2][n] << endl;
row v;
ll pos = n;
for(int i = k; i >= 1; i --){
v.pb(opt[i][pos]);
pos = opt[i][pos];
}
reverse(all(v));
for(auto x : v) cout << x << " "; cout << endl;
}
/**
*/
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:76:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
76 | for(auto x : v) cout << x << " "; cout << endl;
| ^~~
sequence.cpp:76:36: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
76 | for(auto x : v) cout << x << " "; cout << endl;
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
1388 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
2 ms |
1136 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
1260 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
7 ms |
2028 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
12 ms |
2028 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
10 ms |
1772 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
9 ms |
2028 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
7 ms |
2028 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
748 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
5 ms |
1132 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
748 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
5 ms |
748 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
74 ms |
9324 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
4 ms |
748 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
82 ms |
5868 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
84 ms |
6896 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
73 ms |
7148 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
53 ms |
5996 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
77 ms |
6764 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
93 ms |
8428 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
38 ms |
4588 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
37 ms |
4588 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
820 ms |
82412 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
41 ms |
5100 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1515 ms |
82028 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
958 ms |
58404 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
809 ms |
62828 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
590 ms |
51564 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
791 ms |
58604 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
999 ms |
74348 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |