Submission #989103

#	Time	Username	Problem	Language	Result	Execution time	Memory
989103		OAleksa	Split the sequence (APIO14_sequence)	C++14	50 / 100	2055 ms	131072 KiB

sequence

#include <bits/stdc++.h>
#define f first
#define s second
#define int long long
using namespace std;
const int N = 1e5 + 69;
const int K = 220;
int n, a[N], dp[N][K], p[N], k;
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
    cin >> n >> k;
    for (int i = 1;i <= n;i++)
      cin >> a[i];
    for (int i = 1;i <= n;i++)
      p[i] = p[i - 1] + a[i];
    auto Get = [&](int l, int r) {
      return p[r] - p[l - 1];
    };
    for (int i = 0;i <= n;i++) {
      for (int j = 0;j <= k;j++)
        dp[i][j] = -1e18;
    }
    dp[0][0] = 0;
    for (int i = 1;i < n;i++) {
      for (int j = 1;j <= k;j++) {
        for (int k = i - 1;k >= 0;k--) {
          dp[i][j] = max(dp[i][j], dp[k][j - 1] + Get(k + 1, i) * Get(i + 1, n));
        }
      }
    }
    int ans = 0;
    for (int i = 1;i < n;i++)
      ans = max(ans, dp[i][k]);
    vector<int> res;
    int t = -1;
    for (int i = 1;i < n;i++) {
      if (ans == dp[i][k])
        t = i;
    }
    assert(t != -1);
    res.push_back(t);
    for (int j = t - 1;j >= 1 && k > 0;j--) {
      int dd = dp[j][k - 1] + Get(j + 1, t) * Get(t + 1, n);
      if (dd == dp[t][k]) {
        res.push_back(j);
        --k;
        t = j;
      }
    }
    cout << ans << '\n';
    reverse(res.begin(), res.end());
    for (auto j : res) 
      cout << j << ' ';
  }
  return 0; 
}

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 17 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29