Submission #957351

#	Time	Username	Problem	Language	Result	Execution time	Memory
957351		vjudge1	수열 (APIO14_sequence)	C++14	71 / 100	2047 ms	130160 KiB

sequence

#include<bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define int long long

struct Line {
	mutable int m, p;
   mutable int32_t k, tr;
	bool operator<(const Line& o) const { return k < o.k; }
	bool operator<(ll x) const { return p < x; }
};

const ll inf = LLONG_MAX;
struct LineContainer : vector<Line> {
	// (for doubles, use inf = 1/.0, div(a,b) = a/b)
	ll div(ll a, ll b) { // floored division
		return a / b - ((a ^ b) < 0 && a % b); }
	bool isect(iterator x, iterator y) {
		if (y == end()) return x->p = inf, 0;
		if (x->k == y->k) x->p = x->m > y->m ? inf : -inf;
		else x->p = div(y->m - x->m, x->k - y->k);
		return x->p >= y->p;
	}
	void add(int32_t k, ll m, int32_t tr) {
		auto z = insert(end(), {m, 0, k, tr}), y = z++, x = y;
		while (isect(y, z)) z = erase(z);
		if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
		while ((y = x) != begin() && (--x)->p >= y->p)
			isect(x, erase(y));
	}
   int id=0;
	pair<int, int32_t> query(ll x) {
      if (empty()) return {-inf, 0};
      while ((begin()+id)->p<x) ++id;
		return {(begin()+id)->k * x + (begin()+id)->m, (begin()+id)->tr};
	}
   void merge(const LineContainer &tl, const LineContainer &tr){
      for (auto &i:tl) add(i.k, i.m, i.tr);
      for (auto &i:tr) add(i.k, i.m, i.tr);
   }
};

struct FenwickTree{
   int n;
   vector<LineContainer> t;
   void init(int _n){
      n=_n;
      t.assign(n+1, LineContainer());
   }
   void clear(){
      for (int i=0; i<=n; ++i) t[i].clear(), t[i].shrink_to_fit(), t[i].id=0;
   }
   void update(int pos, int k, int m, int tr){
      for (int i=pos; i<=n; i+=i&(-i)) t[i].add(k, m, tr);
   }
   pair<int, int32_t> query(int pos, int x){
      pair<int, int32_t> ans={-inf, 0};
      for (int i=pos; i; i-=i&(-i)) ans=max(ans, t[i].query(x));
      return ans;
   }
} bit[2];

int n, k;
int32_t a[100001], pf[100001];
int32_t tr[100001][201];

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> k; ++k;
   for (int i=1; i<=n; ++i) cin >> a[i];
   partial_sum(a, a+n+1, pf);
   bit[0].init(n);
   bit[1].init(n);
   bit[0].update(1, 0, 0, 0);
   int res=0;
   for (int j=1; j<=k; ++j){
      bit[j&1].clear();
      for (int i=1; i<=n; ++i){
         auto tmp=bit[(j&1)^1].query(i, pf[i]);
         if (tmp.first==-inf) continue;
         if (i==n && j==k) res=tmp.first;
         tr[i][j]=tmp.second;
         bit[j&1].update(i+1, pf[i], tmp.first-1ll*pf[i]*pf[i], i);
      }
   }
   cout << res << '\n';
   vector<int> ans;
   while (n){
      if (tr[n][k]) ans.push_back(tr[n][k]);
      n=tr[n][k];
      --k;
   }
   reverse(ans.begin(), ans.end());
   for (int i:ans) cout << i << ' ';
   return 0;
}

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