Submission #1674594

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
#include <tuple>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e12;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
#define MAX_N 100100 * 3

int m, n, k;
ll a[100100];
ll dp[100100][100];

int main() {
	cin >> n >> m >> k;
	rep(i, n) {
		cin >> a[i];
		dp[i][1] = a[i];
	}
	rep(i, n) {
		FOR(j, 1, m + 1) {
			FOR(l, 1, k + 1) {
				if (i - j >= 0) {
					dp[i][l] = max(dp[i][l], dp[i - j][l - 1] + l*a[i]);
				}
			}
		}
	}
	//rep(i, n) {
	//	rep(j, k + 1) {
	//	
	//	}
	//}
	ll ans = 0;
	rep(i, n) {
		ans = max(ans, dp[i][k]);
	}
	cout << ans << endl;
}

Submission Info

Judge Result