#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 1e5 + 5;
ll dp[N][2];
int opt[N][205];
int a[N];
void DP(int k, int l, int r, int optl, int optr){
if (l > r) return;
int mid = (l + r) >> 1;
dp[mid][1] = -1e18;
int bestl = mid - 1, bestr = optl;
for (int i = optl; i <= min(mid - 1, optr); i++){
if (dp[mid][1] == (dp[i][0] + 1ll * a[i] * (a[mid] - a[i]))){
dp[mid][1] = dp[i][0] + 1ll * a[i] * (a[mid] - a[i]);
bestl = min(bestl, i);
bestr = max(bestr, i);
opt[mid][k] = i;
}
if (dp[mid][1] < (dp[i][0] + 1ll * a[i] * (a[mid] - a[i]))){
dp[mid][1] = dp[i][0] + 1ll * a[i] * (a[mid] - a[i]);
bestl = i;
bestr = i;
opt[mid][k] = i;
}
}
DP(k, l, mid - 1, optl, bestl);
DP(k, mid + 1, r, bestr, optr);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("VietCT.INP", "r")){
freopen("VietCT.INP", "r", stdin);
freopen("VietCT.OUT", "w", stdout);
}
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i], a[i] = a[i] + a[i - 1];
for (int i = 1; i <= k; i++){
DP(i, 1, n, 1, n);
for (int j = 1; j <= n; j++){
dp[j][0] = dp[j][1];
}
}
cout << dp[n][1] << endl;
for (int i = k; i >= 1; i--){
cout << opt[n][i] << " ";
n = opt[n][i];
}
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:38:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
38 | freopen("VietCT.INP", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:39:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
39 | freopen("VietCT.OUT", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
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 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 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 |
0 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
0 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 |
0 ms |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
0 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 |
0 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
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 |
2 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 |
2 ms |
512 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
결과 |
실행 시간 |
메모리 |
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 |
9 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 |
11 ms |
1152 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
10 ms |
1152 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
9 ms |
1152 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
8 ms |
1152 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
1152 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
결과 |
실행 시간 |
메모리 |
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 |
106 ms |
8616 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
7 ms |
8576 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
94 ms |
8576 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
99 ms |
8696 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
97 ms |
8696 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
74 ms |
8576 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
90 ms |
8576 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
113 ms |
8576 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
74 ms |
82552 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
76 ms |
82552 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
1961 ms |
82680 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
76 ms |
82684 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Execution timed out |
2037 ms |
82552 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |