Submission #2011710

---

Source Code Expand

#include <bits/stdc++.h>
#define INF 1e+18
#define int long long
using namespace std;

signed main(){
	int n,m,k,a[100010],dp[2][100010] = {},*now = dp[0],*nxt = dp[1],ma = 0;
	cin >> n >> m >> k;
	for(int i = 0;i < n;i++) cin >> a[i];
	for(int i = 1;i <= k;i++){
		deque<int> deq;
		for(int j = 0;j <= n;j++) nxt[j] = -INF;
		for(int j = 0;j < n;j++){
			while(!deq.empty() && now[deq.back()] <= now[j]) deq.pop_back();
			deq.push_back(j);
			nxt[j + 1] = now[deq.front()] + a[j] * i;
			if(deq.front() == j - m + 1) deq.pop_front();
		}
		swap(now,nxt);
	}
	for(int i = 0;i <= n;i++) ma = max(ma,now[i]);
	cout << ma << endl;
	return 0;
}

Submission Info

Judge Result