ch0601 Genius ACM 倍增

题目链接：http://contest-hunter.org:83/contest/0x00%E3%80%8C%E5%9F%BA%E6%9C%AC%E7%AE%97%E6%B3%95%E3%80%8D%E4%BE%8B%E9%A2%98/0601%20Genius%20ACM

 

解法：

倍增的思想。

注意的一点是枚举p的时候因为有可能不符合条件，而判断的时候又需要排序，因此需要额外的数组来保存，判断结果为真才赋值回去

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 5e5 + 7;
ll num[maxn], s1[maxn], s2[maxn];
int n, m;
ll k;
void Merge(int l,int mid,int r) { //s2 为暂时储存的
	int i = l, j = mid + 1;
	for (int k = l; k <= r; k++) {
		if (j > r || i <= mid && num[i] <= s1[j]) s2[k] = num[i++];
		else s2[k] = s1[j++];
	}
}
bool check(int l,int mid,int r) {
	for (int i = mid+1; i <= r; i++) s1[i] = num[i];
	sort(s1 + mid + 1, s1 + r + 1);
	Merge(l, mid, r);
	int count = m;
	ll ans = 0;
	while (l < r && count) {
		count--;
		ans += (1LL*s2[r] - s2[l])*(s2[r] - s2[l]);
		l++, r--;
	}
	if (ans <= k) return 1;
	else return 0;
}
int main() {
	int t; cin >> t;
	while (t--) {
		scanf("%d %d", &n, &m);
		scanf("%lld", &k);
		for (int i = 1; i <= n; i++) scanf("%lld", num + i);
		int beg = 1, end = 1, step = 1,cnt=0;
		while (beg <= n) {
			while (step) {
				if (end+step > n) {
					step >>= 1;
					continue;
				}
				if (check(beg, end, end+step)) {
					for (int i = beg; i <= end+step; i++) num[i] = s2[i];
					end += step;
					step <<= 1;
				}
				else {
					step >>= 1;
				}
			}
			cnt++;
			beg = end + 1;
			end = beg;
			step = 1;
		}
		cout << cnt << endl;
	}
	return 0;
}