#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()
#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const char nl = '\n';
const int mxN = 2e5 + 10;
const int mxK = 201;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;
ll dp[2][mxN]; int L[mxN][mxK]; ll p[mxN], a[mxN], n, K;
void divi(int k, int l, int r, int opt_l, int opt_r){
if(l > r) return;
int m = (l+r)/2;
int pos = opt_l; ll ma = 0;
for(int i = opt_l; i <= min(m-1, opt_r); i++){
if(ckmax(ma, 1LL*dp[0][i]+1LL*(p[m]-p[i])*p[i])){
pos = i;
}
}
dp[1][m] = ma;
L[m][k] = pos;
divi(k, l, m-1, opt_l, pos);
divi(k, m+1, r, pos, opt_r);
}
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> K;
FOR(i, 1, n+1){
cin >> a[i];
p[i] = a[i] + p[i-1];
}
ll bst = 0, val = 0;
FOR(i, 1, K+1){
divi(i, 1, n, 1, n);
FOR(j, 1, n+1) dp[0][j] = dp[1][j];
// cout << nl;
if(i==K){
FOR(j, 1, n+1){
if(ckmax(val, dp[0][j])){
bst = j;
}
}
}
}
vi res;
cout << val << nl;
int k = K;
while(k>0){
res.pb(L[bst][k]);
bst = L[bst][k];
k--;
}
// cout << L[bst][1] << nl;
// assert(siz(res)==K);
trav(x, res){
cout << x << ' ';
}
cout << nl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Incorrect |
1 ms |
384 KB |
Integer 0 violates the range [1, 1] |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
1 ms |
512 KB |
position 1 occurs twice in split scheme |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
1152 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1152 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
1152 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
8576 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
8576 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
72 ms |
8576 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
8704 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
75 ms |
8576 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
77 ms |
8608 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
66 ms |
8576 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
49 ms |
8604 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
68 ms |
8576 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
86 ms |
8704 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
71 ms |
82300 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
69 ms |
82168 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1238 ms |
82296 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
67 ms |
82168 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1711 ms |
82216 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1165 ms |
82296 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1020 ms |
82296 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
810 ms |
82296 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1022 ms |
82296 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1308 ms |
82200 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
