Submission #997998

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int N, M, K;
int A[100000];

ll dp[100001][301];

int main(int argc, char **argv) {
	cin >> N >> M >> K;
	REP(i, N) cin >> A[i];
	REP(i, N) dp[i][0] = 0;
	REP(i, K) dp[0][i] = 0;
	FOR(i, 1, N + 1) FOR(j, 1, K + 1) {
		dp[i][j] = 0;
		FOR(k, 1, M + 1) if (i - k >= 0 && (j == 1 || dp[i - k][j - 1] > 0)) dp[i][j] = max(dp[i][j], dp[i - k][j - 1] + j * A[i - 1]);
	}
	REP(i, N + 1) {
		REP(j, K + 1) {
			cerr << dp[i][j] << " ";
		}
		cerr << endl;
	}
	ll res = 0;
	REP(i, N + 1) res = max(res, dp[i][K]);
	cout << res << endl;
	return 0;
}

Submission Info

Judge Result