#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int sz = 1e4 + 5;
long long a[sz], s[sz];
int n, k;
namespace SUB123{
bool ok(){
return (n <= 200);
}
void solve(){
vector<vector<int>> f(n+5, vector<int>(k+5, 0));
for(int j=1; j<=k+1; ++j){
for(int i=1; i<=n; ++i){
int L = 0, R = s[n] - s[i];
for(int g=i; g>=j; --g){
L += a[g];
f[i][j] = max(f[i][j], f[g-1][j-1] + (L * R));
}
}
}
cout<<f[n][k+1];
//---------------------
exit(0);
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//freopen("main.inp","r",stdin);
//freopen("main.out","w",stdout);
cin>>n>>k;
for(int i=1; i<=n; ++i){
cin>>a[i];
s[i] = s[i-1] + a[i];
}
SUB123::solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
456 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
348 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
289 ms |
1596 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
860 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |