Submission #998414

---

Source Code Expand

#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cstring>
#include <numeric>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define F0(i,n) for (int i = 0; i < n; i++)
#define F1(i,n) for (int i = 1; i <= n; i++)
#define CL(a,x) memset(x, a, sizeof(x));
#define SZ(x) ((int)x.size())
const double eps = 1e-10;
const int inf = 1000000009;
int i, j, k, m, n, l;
int insd;
const int N = 100001;
ll a[N], dp[2][N];

ll s1[N], smax[N], c1;
ll s2[N], s2max, c2;

void reset() {
	c1 = c2 = s2max = 0;
}

void push(ll x) {
	s2[c2++] = x;
	if (x > s2max) s2max = x;

	while (c1 + c2 > m) {
		if (c1) c1--;
		else {
			for (int i = c2 - 1; i >= 0; i--) {
				smax[c1] = s1[c1] = s2[i];
				if (c1 > 0 && smax[c1 - 1] > smax[c1]) smax[c1] = smax[c1 - 1];
				c1++;
			}
			c2 = 0;
			s2max = 0;
		}
	}
}

ll get_max() {
	if (c1 == 0) return s2max;
	return max(s2max, smax[c1 - 1]);
}

int main() {
	//freopen("x.in", "r", stdin);
	cin >> n >> m >> k;
	F1(i, n) cin >> a[i];

	F1(i, n) dp[0][i] = a[i];

	for (int kk = 2; kk <= k; kk++) {
		reset();
		int i1 = kk % 2;
		int i2 = 1 - i1;

		insd = kk - 1;
		for (int i = kk; i <= n; i++) {
			while (insd < i) {
				push(dp[i1][insd]);
				insd++;
			}
			dp[i2][i] = kk * a[i] + get_max();
		}

		if (kk == k) {
			ll ans = 0;
			for (int i = k; i <= n; i++) {
				ans = max(ans, dp[i2][i]);
			}
			cout << ans << endl;
		}
	}

	return 0;
}

Submission Info

Judge Result