Submission #2421208

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
using Int = long long;
//INSERT ABOVE HERE
signed main(){
  Int n,m,k;
  cin>>n>>m>>k;
  vector<Int> a(n);
  for(Int i=0;i<n;i++) cin>>a[i];
  vector<Int> dp(a);
  for(Int i=1;i<k;i++){
    vector<Int> nx(n,0);
    deque<Int> d;
    for(Int j=i;j<n;j++){
      while(!d.empty()&&d.front()<j-m) d.pop_front();
      while(!d.empty()&&dp[d.back()]<=dp[j-1]) d.pop_back();
      d.emplace_back(j-1);
      nx[j]=dp[d.front()];
    }
    swap(dp,nx);
    for(Int j=0;j<n;j++) dp[j]+=(i+1)*a[j];
  }
  cout<<*max_element(dp.begin(),dp.end())<<endl;
  return 0;
}

Submission Info

Judge Result