CF679 C Perform Easily (双指针)

Link: Codeforces Round #679 C Perform Easily (双指针)

枚举所有组合，排序后用双指针来找可行区间，用map来维护集合(当前区间存在的 $b_i$)，时间复杂度 $O(nmlog(nm))$

Code

#include <iostream>
#include <algorithm>
#include <map>
using namespace std;

const int N = 6e6 + 5;

pair<int, int> p[N];
int a[10], b[1000005];

int main()
{
	int n;
	for (int i = 1; i <= 6; i++) cin >> a[i];
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> b[i];
	for (int i = 1; i <= 6; i++) {
		for (int j = 1; j <= n; j++) {
			p[(i - 1) * n + j] = make_pair(b[j] - a[i], j);
		}
	}
	sort(p + 1, p + 1 + 6 * n);

	map<int, int> mp;
	int l = 1, r = 1, ans = 0x3f3f3f3f;
	while(r <= 6 * n) {
		while (mp.size() < n && r <= 6 * n) {
			mp[p[r].second]++;
			r++;
		}
		while (mp.size() == n) {
			ans = min(p[r-1].first - p[l].first, ans);
			mp[p[l].second]--;
			if(mp[p[l].second] == 0) mp.erase(mp.find(p[l].second));
			l++;
		}
	}
	cout << ans << endl;
	return 0;
}