제출 #259046

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
259046		KoD	수열 (APIO14_sequence)	C++17	22 / 100	2072 ms	32640 KiB

sequence

#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>

#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 

};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = typename std::decay<T>::type::reverse_iterator;

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }

};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/fix_point.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/fix_point.cpp"

template <class Func>
struct fix_point_impl: private Func {
  explicit constexpr fix_point_impl(Func &&func): Func(std::forward<Func>(func)) { }
  template <class... Args>
  constexpr decltype(auto) operator () (Args &&... args) const {
    return Func::operator()(*this, std::forward<Args>(args)...);
  }
};

template <class Func>
constexpr decltype(auto) fix_point(Func &&func) {
  return fix_point_impl<Func>(std::forward<Func>(func));
}

/**
 * @title Lambda Recursion
 */
#line 18 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

i64 dp[200][201][200];

int main() {
  i32 N, K;
  std::cin >> N >> K;
  assert(N <= 200);
  std::vector<i32> A(N);
  for (auto &x: A) {
    std::cin >> x;
  }
  std::vector<i64> sum(N + 1);
  for (auto i: range(0, N)) {
    sum[i + 1] = sum[i] + A[i];
  }
  for (auto l: range(0, N)) {
    for (auto r: range(l + 1, N + 1)) {
      dp[l][r][0] = 0;
      for (auto k: range(1, K + 1)) {
        dp[l][r][k] = -inf64;
      }
    }
  }
  for (auto len: range(2, N + 1)) {
    for (auto l: range(0, N - len + 1)) {
      auto r = l + len;
      for (auto m: range(l + 1, r)) {
        for (auto s: range(0, std::min<i64>(K, m - l))) {
          for (auto t: range(0, std::min<i64>(K - s, r - m))) {
            chmax(dp[l][r][s + t + 1], dp[l][m][s] + dp[m][r][t] + (sum[m] - sum[l]) * (sum[r] - sum[m]));
          }
        }
      }
    }
  }
  std::cout << dp[0][N][K] << '\n';
  std::vector<i32> step;
  fix_point([&](auto dfs, i32 l, i32 r, i32 k) {
    if (k == 0) return;
    for (auto m: range(l + 1, r)) {
      for (auto s: range(0, std::min<i64>(k, m - l))) {
        if (dp[l][r][k] == dp[l][m][s] + dp[m][r][k - s - 1] + (sum[m] - sum[l]) * (sum[r] - sum[m])) {
          step.push_back(m);
          dfs(l, m, s);
          dfs(m, r, k - s - 1);
          return;
        }
      }
    }
  })(0, N, K);
  for (auto i: range(0, K)) {
    std::cout << step[i] << (i + 1 == K ? '\n' : ' ');
  }
  return 0;
}

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