Submission #2013097

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
#include <deque>
using namespace std;

#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF (1LL<<60)
#define MOD 1000000007
typedef pair<long long, long long> P;

struct SlideMin {
  long long *src;
  int right;
  deque<P> deq;
  SlideMin() : src(NULL), right(0) {}
  SlideMin(long long *src) : src(src), right(0) {}
  void add(int x, long long y) {
    while (!deq.empty() && deq.back()._2 >= y) deq.pop_back();
    deq.push_back(P(x, y));
  }
  long long query(int l, int r) {
    while (right <= r) {
      add(right, src[right]);
      right++;
    }
    while (!deq.empty() && deq.front()._1 < l) deq.pop_front();
    if (deq.empty()) return INF;
    return deq.front()._2;
  }
};

int N, M, K;
int A[100000];
long long dp[301][100000];
SlideMin smin[301];

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> M >> K;
  rep(i, N) cin >> A[i];
  rep(k, K+1) rep(i, N) dp[k][i] = INF;
  rep(i, N) dp[0][i] = 0;
  rep(k, K+1) smin[k] = SlideMin(dp[k]);
  dp[1][0] = -A[0];
  rep(k, K) rep(i, N) {
    dp[k+1][i] = min(dp[k+1][i], -(-smin[k].query(i-M, i-1) + 1LL*(k+1)*A[i]));
  }
  long long m = 0;
  rep(i, N) m = max(m, -dp[K][i]);
  cout << m << "\n";
  return 0;
}

Submission Info

Judge Result