Submission #8658185

---

Source Code Expand

/**
 *    author:  tourist
 *    created: 26.11.2019 09:39:34       
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<long long> dp(n);
  for (int i = 0; i < n; i++) {
    dp[i] = a[i];
  }
  vector<long long> new_dp(n);
  vector<int> st;
  for (int it = 1; it < k; it++) {
    new_dp[0] = (long long) -1e18;
    st.clear();
    int ptr = 0;
    for (int i = 0; i < n - 1; i++) {
      while (ptr < (int) st.size() && st[ptr] <= i - m) {
        ++ptr;
      }
      while (ptr < (int) st.size() && dp[st.back()] <= dp[i]) {
        st.pop_back();
      }
      st.push_back(i);
      new_dp[i + 1] = dp[st[ptr]] + (it + 1LL) * a[i + 1];
    }
    swap(dp, new_dp);
  }
  cout << *max_element(dp.begin(), dp.end()) << '\n';
  return 0;
}

Submission Info

Judge Result