Submission #3289137

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
 
#define mod 1000000007
#define FOR(x,to) for(int x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define long long long
inline int rei(){int x;cin>>x;return x;}
inline long rel(){long x;cin>>x;return x;}
inline string res(){string x;cin>>x;return x;}
//------------------------------------------------------- 
deque<pair<int,long>> DP[301];
long A[100000];
void Calc(){
	int N = rei();
	int M = rei();
	int K = rei();
	for(int i=0;i<N;i++){
		A[i] = rel();
	}
	long ans = 0;
	for(int i=N-1;i>=0;i--){
		for(int j=K;j>1;j--){
			while(!DP[j-1].empty()){
				if(DP[j-1].front().first > i+M){
					DP[j-1].pop_front();
				}
				else{
					break;
				}
			}
			if(!DP[j-1].empty()){
				while(!DP[j].empty() && DP[j].back().second <= DP[j-1].front().second+(K-j+1)*A[i]){
					DP[j].pop_back();
				}
				DP[j].push_back({i,DP[j-1].front().second+(K-j+1)*A[i]});
			}
		}
		{
			while(!DP[1].empty() && DP[1].back().second <= K*A[i]){
				DP[1].pop_back();
			}
			DP[1].push_back({i,K*A[i]});
		}
		if(!DP[K].empty()){
			ans = max(ans,DP[K].front().second);
		}
	}
	cout << ans << endl;
}
int main(int argc,char** argv){
	ios::sync_with_stdio(false), cin.tie(0);
	cout.tie(0); Calc(); return 0;
}

Submission Info

Judge Result