Submission #1986407

---

Source Code Expand

#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a < b) ? (a = b, 1) : 0;}
template<class T>bool chmin(T &a, const T &b) { return (b < a) ? (a = b, 1) : 0;}

using ll = long long;
const ll inf = 1LL << 50;


ll a[100010];

// {1 1 4 2 3 5}
// min {1,1,2,3,5} みたいに管理

void add(auto &deq, ll x) {
	while (!deq.empty() and deq.back() < x) deq.pop_back();
	deq.push_back(x);
}

void del(auto &deq, ll x) {
	if (!deq.empty() and deq.front() == x) deq.pop_front();
}

ll getval(auto &deq) {
	return (deq.empty()) ? -inf : deq.front();
}

ll dp[100010], dp2[100010];


int main(void) {
	ll n, m, k;
	cin >> n >> m >> k;

	rep(i, n) cin >> a[i];
	rep(i, n) dp[i] = a[i];

	rep(i, 2, k + 1) {
		deque<ll> deq;
		rep(j, n) {
			dp2[j] = 1LL * i * a[j] + getval(deq);
			add(deq, dp[j]);
			if (j - m >= 0) del(deq, dp[j - m]);
		}
		rep(j, n) dp[j] = dp2[j];
	}

	ll ans = 0LL;
	rep(j, n) chmax(ans, dp[j]);
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result