Submission #1913686

---

Source Code Expand

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define RE return 0
//ios::sync_with_stdio(false);
//std::cin.tie(0);
//<< setprecision(20)
const int mod=1e9+7;
const int big=1e9+100;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
template <class T> void soun(T& ar)
{sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());}
llint gcd(llint a,llint b){if(a%b==0){return b;}else{return gcd(b,a%b);}}
llint lcm(llint a,llint b){return a/gcd(a,b) *b;}
int main(void){
	//(部分点はRMQ)
	//スライド最大値₯
	//O(NK)
	llint n,m,K,i,j,ans=0;cin>>n>>m>>K;
	vector<llint>dp(n);
	vector<llint>pot(n);
	for(i=0;i<n;i++){cin>>pot[i];}
	for(i=1;i<=K;i++){
		deque<pair<int,llint>>slide;
		if(i==1){slide.pub(mp(0,0LL));}
		for(j=0;j<n;j++){
			llint mot=dp[j];
			if(slide.size()>0&&slide.front().fir<j-m){slide.pof();}
			if(i-1<=j){
				dp[j]=slide.front().sec+i*pot[j];
				maxeq(ans,dp[j]);
			}
			while(slide.size()>0&&slide.back().sec<=mot){slide.pob();}
			slide.pub(mp(j,mot));
			
			//cerr<<dp[j]<<" ";
		}
		//cerr<<endl;
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result