Submission #1807813

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;

template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

const int INF=1001001001001001001ll;
int N,M,K;
int A[111111];

int dp[111111];

int nex[111111];
signed main(){
    cin>>N>>M>>K;
    rep(i,N)cin>>A[i];
    for(int i=0;i<N;i++)dp[i]=A[i];
    rep(i,K-1){
        deque<int>d;
        for(int j=0;j<N;j++){
            while(d.size()&&j-d.front()>M)d.pop_front();
            if(d.size())nex[j]=(i+2)*A[j]+dp[d.front()];
            else nex[j]=-INF;
            while(d.size()&&dp[d.back()]<=dp[j])d.pop_back();
            d.pb(j);
        }
        rep(j,N)dp[j]=nex[j];
    }

    cout<<*max_element(dp,dp+N)<<endl;
    return 0;
}

Submission Info

Judge Result