제출 #959885

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
959885		mannshah1211	수열 (APIO14_sequence)	C++17	50 / 100	2061 ms	24924 KiB

sequence

/**
 *  author: hashman
 *  created: 
**/

#include <bits/stdc++.h>

using namespace std;

string to_string(string s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
   if (!first) {
    res += ", ";
   }
   first = false;
   res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() {
  cerr << endl;
}

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__);

const int64_t inf = 1e17;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> a(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  vector<int> p(n + 1);
  for (int i = 1; i <= n; i++) {
    p[i] = p[i - 1] + a[i];
  }
  auto cost = [&](int l, int r) {
    return ((int64_t) (p[r] - p[l - 1]) * (p[r] - p[l - 1]));
  };
  k++;
  vector<vector<int64_t>> dp(n + 1, vector<int64_t>(k + 1, inf));
  dp[0][0] = 0;
  vector<vector<int>> pr(n + 1, vector<int>(k + 1));
  for (int j = 1; j <= k; j++) {
    for (int i = 1; i <= n; i++) {
      for (int prev = i; prev >= 1; prev--) {
        dp[i][j] = min(dp[i][j], dp[prev - 1][j - 1] + cost(prev, i));
        if (dp[i][j] == dp[prev - 1][j - 1] + cost(prev, i)) {
          pr[i][j] = prev - 1;
        }
      }
    }
  }
  cout << ((int64_t) p[n] * p[n] - dp[n][k]) / 2 << '\n';
  int cur = n;
  vector<int> splits;
  while (cur != 0) {
    cur = pr[cur][k];
    k--;
    if (cur != 0) {
      splits.push_back(cur);
    }
  }
  reverse(splits.begin(), splits.end());
  for (int split : splits) {
    cout << split << " ";
  }
  cout << '\n';
}

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