제출 #959932

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

sequence

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

#pragma GCC optimize("O2")
#pragma GCC target("avx2,bmi2")
 
#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__);
 
int64_t inf = 1e18;

int pr[100001][201];
 
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<int64_t> dp_cur(n + 1, inf), dp_before(n + 1, inf);
  dp_before[0] = 0;
  auto compute = [&](auto&& self, int at, int l, int r, int bl, int br) -> void {
    if (l > r) {
      return;
    }
    int m = (l + r) / 2;
    pair<int64_t, int> best = make_pair(4 * inf, -1);
    for (int i = bl; i <= min(m, br); i++) {
      best = min(best, make_pair(dp_before[i - 1] + cost(i, m), i));
    }
    if (best.second != -1) pr[m][at] = best.second - 1;
    dp_cur[m] = min(dp_cur[m], best.first);
    if (true) self(self, at, l, m - 1, bl, best.second);
    else self(self, at, l, m - 1, bl, br);
    if (true) self(self, at, m + 1, r, best.second, br);
    else self(self, at, m + 1, r, bl, br);
  };
  for (int i = 1; i <= k; i++) {
    compute(compute, i, 1, n, 1, n);
    dp_before = dp_cur;
    dp_cur.assign(n + 1, inf);
  }
  cout << ((int64_t) p[n] * p[n] - dp_before[n]) / 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: 21 / 21
• Subtask 6: 29 / 29