#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
int32_t main() {
int n, K;
cin >> n >> K;
vector<int> v(n+1);
for(int i=1; i<=n; i++) cin >> v[i];
vector<ll> pref(n+1);
for(int i=1; i<=n; i++) pref[i] = pref[i-1] + v[i];
ll dp[n+1][K+1];
int par[n+1][K+1];
memset(par, 0, sizeof(par));
memset(dp, 0, sizeof(dp));
for(int i=1; i<=n; i++) {
for(int j=1; j<=K; j++) {
for(int k=i; k>=1; k--) {
if(dp[i][j] < dp[k-1][j-1] + (pref[i] - pref[k-1]) * (pref[n] - pref[i])) {
dp[i][j] = dp[k-1][j-1] + (pref[i] - pref[k-1]) * (pref[n] - pref[i]);
par[i][j] = k-1;
}
}
}
}
int pos = 0;
for(int i=1; i<n; i++)
if(dp[i][K] >= dp[pos][K]) pos = i;
cout << dp[pos][K] << '\n';
int curr = pos, k = K;
vector<int> ans;
while(k) {
ans.push_back(curr);
curr = par[curr][k];
if(k == 1) break;
k--;
}
reverse(all(ans));
for(int &x : ans) cout << x << " ";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
356 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
344 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
900 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
604 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
860 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
904 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
344 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
348 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
348 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
146 ms |
2652 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
348 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
113 ms |
2780 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
103 ms |
2424 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
116 ms |
2648 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
124 ms |
2648 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
28 ms |
860 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
50 ms |
1620 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
202 ms |
988 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
194 ms |
984 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Execution timed out |
2072 ms |
24152 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2070 ms |
6236 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
