Submission #2283633

---

Source Code Expand

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

const int N = 1e5 + 1, K = 301;

ll dp[K][N];
int a[N];

int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  int n, m, k; cin >> n >> m >> k;
  for(int i = 0; i < n; i++) cin >> a[i + 1];
  for(int i = 1; i <= n - k; i++) dp[1][i] = 1 * a[i];

  // slide minimum
  // 貰うDP
  for(int i = 2; i <= k; i++) {
    deque<int> deq;
    for(int j = max(1, i - m); j <= i - 1; j++) {
      // cerr << " j1 = " << j << endl;
      while(deq.size() && dp[i-1][deq.back()] <= dp[i-1][j]) deq.pop_back();
      deq.emplace_back(j);
    }
    cerr << " i = " << i << endl;
    for(int j = i; j <= n + i - k; j++) {
      if(deq.size() && deq.front() < j - m) deq.pop_front();
      dp[i][j] = dp[i-1][deq.front()] + (ll) i * a[j];
      //
      // cerr << "dp i j  = " << dp[i][j] << endl;
      while(deq.size() && dp[i-1][deq.back()] <= dp[i-1][j]) deq.pop_back();
      deq.emplace_back(j);
    }
  }
  ll ans = 0;
  for(int i = k; i <= n; i++) ans = max(ans, dp[k][i]);
  cout << ans << endl;
}

Submission Info

Judge Result