Submission #3001756

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;

ll to[101010],from[101010];
int A[101010], deq[101010];

int main(){
  int N,M,K; cin>>N>>M>>K;
  for(int i=1;i<=N;i++){
    cin>>A[i];
    from[i]=1LL*A[i];
  }
  for(int i=2;i<=K;i++){
    int s=0,t=0;
    deq[s]=0;
    for(int j=1;j<i;j++){
      while(s<t&&from[deq[t-1]]<=from[j]) t--;
      deq[t++]=j;
    }
    for(int j=i;j<=N;j++){
      to[j]=1LL*A[j]*i+from[deq[s]];
      if(j-M>=1&&deq[s]==j-M) s++;
      while(s<t&&from[deq[t-1]]<=from[j]) t--;
      deq[t++]=j;
    }
    swap(to,from);
  }
  ll ans=0;
  rep(i,N) ans=max(ans,from[i+1]);
  cout<<ans<<endl;
  return 0;
}

Submission Info

Judge Result