HJOJ-838(利用队列来解决三个点在直线上最小距离的问题)

#include<iostream>
#include<stack>
#include<queue>
#include<cstdlib>
using namespace std;
int min_num(int a, int b, int c) {
	if (a > b)swap(a, b);
	if (a > c)swap(a, c);
	return a;
	//作用返回最小值函数
}
int func(queue<int> que1, queue<int> que2, queue<int>que3) {
	int ans = 0x3f3f3f3f;//最大值
	while (!que1.empty() && !que2.empty() && !que3.empty()) {
		int a = que1.front();
		int b = que2.front();
		int c = que3.front();
		int temp_ans = abs(a - b) + abs(b - c) + abs(a - c);//距离
		if (temp_ans < ans) {
			ans = temp_ans;
		}
		int d = min_num(a, b, c);
		if (a == d) {
			que1.pop();
		}
		else if (b == d) {
			que2.pop();
		}
		else {
			que3.pop();
		}
	}
	return ans;
}
int main()
{
	queue<int> que1, que2, que3;
	int m, n, k;
	cin >> m >> n >> k;
	int x;
	for (int i = 0; i < m; i++) {
		cin >> x;
		que1.push(x);
	}
	for (int i = 0; i < n; i++) {
		cin >> x;
		que2.push(x);
	}
	for (int i = 0; i < k; i++) {
		cin >> x;
		que3.push(x);
	}
	cout << func(que1, que2, que3) << endl;
	return 0; 
}