Submission #99879

#TimeUsernameProblemLanguageResultExecution timeMemory
99879WLZSplit the sequence (APIO14_sequence)C++17
0 / 100
2008 ms9080 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<long long> a(n + 1);
  vector<long long> pre(n + 1, 0);
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    pre[i] = pre[i - 1] + a[i];
  }
  vector< vector<long long> > dp(n + 1, vector<long long>(k + 1, 0));
  for (int i = 1; i <= n; i++) {
    for (int t = 1; t <= k; t++) {
      for (int j = 1; j < i; j++) {
        dp[i][t] = max(dp[i][t], dp[j][t - 1] + (pre[i] - pre[j]) * pre[j]);
      }
    }
  }
  cout << dp[n][k] << '\n';
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...