Submission #3025050

---

Source Code Expand

#ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>

#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)

#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

using namespace std;


/*
ll pw(ll a, ll b) {
	ll ans = 1; while (b) {
		while (!(b & 1)) b >>= 1, a = (a * a) % MOD;
		ans = (ans * a) % MOD, --b;
	} return ans;
}
*/

const int MAXN = 2100;

int n, k, q;
int a[MAXN];

int cnt[MAXN];

multiset<pair<int, int> > ss;
int cc[MAXN];

int main() {
#ifdef FASTIO
	ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#endif
	cin >> n >> k >> q;
	for (int i = 0; i < n; ++i)
		cin >> a[i];
	int ans = 1e9 + 100;
	for (int i = 0; i < n; ++i) {
		ss.clear();
		int cur = 0;
		cc[cur] = 0;
		for (int j = 0; j < n; ++j) {
			if (a[j] < a[i]) {
				++cur;
				cc[cur] = 0;
			}
			else {
				++cc[cur];
				ss.emplace(a[j], cur);
			}
		}
		int now = q;
		int mx = a[i];
		while (now && !ss.empty()) {
			auto tmp = *ss.begin();
			ss.erase(ss.begin());
			if (cc[tmp.second] >= k) {
				--cc[tmp.second];
				mx = max(mx, tmp.first);
				--now;
			}
			else
				continue;
		}
		if (now)
			continue;
		ans = min(ans, mx - a[i]);
	}
	cout << ans << "\n";
	return 0;
}

Submission Info

Judge Result