#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define S second
#define F first
//const int inf = 1e18;
const int N = 100005;
const ll inf = 1e18;
int n, y, k, par[N][205], k1, ind;
ll a[N], b[N], pref[N], suma, dp[N][205];
bool cut[N][205], used[N];
vector<int> ans;
ll f(int i, int j, int m){
if(dp[m][j - 1] == -inf) return -inf;
// cout << i << ' ' << j << ' ' << m << '\n';
// cout << dp[m][j - 1] << ' ' << (pref[i] - pref[m]) << ' ' << (pref[n] - pref[i]) << '\n';
return dp[m][j - 1] + (pref[i] - pref[m]) * (pref[n] - pref[i]);
}
main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
k1 = k;
k++;
dp[0][k] = -1;
for(int i = 1; i <= n; ++i){
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
for(int i = 0; i <= n; ++i){
for(int j = 2; j <= k; ++j){
dp[i][j] = -inf;
}
}
for(int i = 1; i <= n; ++i){
for(int j = 2; j <= k; ++j){
// cout << "_____________\n\n";
for(int l = 0; l < i; ++l){
if(f(i, j, l) > dp[i][j]){
dp[i][j] = max(dp[i][j], f(i, j, l));
par[i][j] = l;
}
}
// cout << i << ' ' << j << ' ' << dp[i][j] << '\n';
}
if(dp[i][k] > dp[ind][k]){
ind = i;
}
}
cout << dp[ind][k] << '\n';
// while(dp[ind - 1][k] == dp[ind][k]) ind--;
// cout << ind << '\n';
while(ind != 0){
ans.pb(ind);
ind = par[ind][k];
k--;
}
reverse(ans.begin(), ans.end());
for(auto to : ans){
cout << to << ' ';
}
}
Compilation message
sequence.cpp:27:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
27 | main(){
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 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 |
0 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
460 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
460 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
460 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
460 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
460 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
460 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
716 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
716 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
7 ms |
844 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
716 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
844 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
7 ms |
924 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
7 ms |
844 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
716 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
716 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
716 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
2764 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
4 ms |
2764 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
163 ms |
2704 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
4 ms |
2764 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
202 ms |
2776 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
176 ms |
2732 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
201 ms |
2756 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
161 ms |
2680 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
47 ms |
2756 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
106 ms |
2664 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
520 ms |
24544 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
586 ms |
24620 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Execution timed out |
2078 ms |
19276 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
53 ms |
131076 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
