Submission #651476

#	Time	Username	Problem	Language	Result	Execution time	Memory
651476		pauloamed	Split the sequence (APIO14_sequence)	C++14	0 / 100	294 ms	131072 KiB

sequence

#include<bits/stdc++.h>
using namespace std;

#define int long long

const int MAXN = 300010;

int S[MAXN], wS[MAXN];

int query(int l, int r){
  int a = S[r];
  int b = S[r] - ((l == 0)? 0 : S[l - 1]);
  int c = wS[r] - ((l == 0)? 0 : wS[l - 1]);
  return a * b - c;
}

int last_dp[MAXN];
int curr_dp[MAXN];

const int MAXK = 250;
pair<int,int> ans[MAXN][MAXK];

int get_dp(int i){
  if(i < 0) return 0;
  else return last_dp[i];
}

int sum(int a, int b){
  if(a == LLONG_MAX) return LLONG_MAX;
  if(b == LLONG_MAX) return LLONG_MAX;
  else return a + b;
}

int K;
void solve(int l, int r, int searchL, int searchR){
  if(l > r) return;
  int j = (l + r) / 2;
  if(curr_dp[j] == -1){
    int validR = min(j - 1, searchR);
    pair<int,int> best = {INT_MAX, -1LL};
    for(int k = searchL; k <= validR; ++k){
      best = min(best, {sum(query(k, j), get_dp(k - 1)), k});
    }
    curr_dp[j] = best.first;
    ans[j][K] = best;
    solve(l, j - 1, searchL, best.second);
    solve(j + 1, r, best.second, searchR);
  }
}

int32_t main(){
  int n, k; cin >> n >> k;
  vector<int> v(n); for(auto &x : v) cin >> x;

  int tot = 0;
  for(int i = 0; i < n; ++i){
    S[i] = v[i];
    if(i){
      S[i] += S[i - 1];
      tot += v[i] * S[i - 1];
    }
  }

  for(int i = 0; i < n; ++i){
    wS[i] = S[i] * v[i];
    if(i) wS[i] += wS[i - 1];
  }

  for(int i = 0; i < n; ++i){
    last_dp[i] = query(0, i);
  }

  for(K = 0; K < k; ++K){
    memset(curr_dp, -1, sizeof curr_dp);
    solve(0, n - 1, 0, n - 1);
    swap(curr_dp, last_dp);
  }

  cout << tot - last_dp[n - 1] << "\n";
  // cout << tot << " " << last_dp[n - 1] << "\n";

  auto curr = make_pair(-1, n);
  for(int i = 0; i < k; ++i){
    
    curr = ans[curr.second - 1][k - 1 - i];
    cout << curr.second << " ";
  }
  cout << "\n";
}

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