Submission #1137472

---

Source Code Expand

 #include<bits/stdc++.h>
 using namespace std;
#define INF 1000000000
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
typedef long long LL;
int M,N;
int K;
LL A[100001];
LL dp[302][100001];
LL deq[100001];
int main(){
    REP(i,302){
        REP(j,100001){
            dp[i][j]=0;
        }
    }
    cin>>N>>M>>K;
    REP(i,N){
        cin>>A[i];
        dp[0][i]=A[i];
    }
    for(int i=1;i<K;i++){
        deq[0]=0;
        //dp[i][0]=A[0];
        int bg=0;
        int ed=1;
        REP(j,N){
            if(j==0)continue;
            dp[i][j]=dp[i-1][deq[bg]]+(i+1)*A[j];
            while(ed>bg){
               if(dp[i-1][j]<=dp[i-1][deq[ed-1]])break;
               ed--;
            }
            deq[ed]=j;
            ed++;
            if(j>=M){
               if(deq[bg]==j-M)bg++;
            }
        }
        /*REP(j,N){
            cout<<dp[i][j]<<" ";
        }
        cout<<endl;
        */
    }
    LL ans=0;
    REP(i,N){
        ans=max(ans,dp[K-1][i]);
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result