uva11995-优快云博客

这篇博客探讨了如何使用栈、队列和优先级队列来验证数组中元素的一一对应关系。通过实现CheckStack、CheckQueue和CheckPriority_queue三个函数，检查输入的两个数组是否可以通过这些数据结构保持顺序对应。程序读取数组长度和元素，然后分别判断使用栈、队列和优先级队列是否能得到正确的顺序，最后输出匹配的数据结构名称或不可能的结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1007;
int a[maxn], b[maxn],n;

bool CheckStack() {
	stack<int> st;
	for (int i = 0; i < n; i++) {
		if (a[i] == 1) {
			st.push(b[i]);
		}
		else {
			if (st.empty()) return false;
			int top = st.top();
			st.pop();
			if (top != b[i]) return false;
		}
	}
	return true;
}

bool CheckQueue() {
	queue<int> q;
	for (int i = 0; i < n; i++) {
		if (a[i] == 1) {
			q.push(b[i]);
		}
		else {
			if (q.empty()) return false;
			int front = q.front();
			q.pop();
			if (front != b[i]) return false;
		}
	}
	return true;
}

bool CheckPriority_queue() {
	priority_queue<int> q;
	for (int i = 0; i < n; i++) {
		if (a[i] == 1) {
			q.push(b[i]);
		}
		else {
			if (q.empty()) return false;
			int front = q.top();
			q.pop();
			if (front != b[i]) return false;
		}
	}
	return true;
}
int main()
{
	while (cin >> n) {
		for (int i = 0; i < n; i++) {
			cin >> a[i] >> b[i];
		}
		bool r1 = CheckStack();
		bool r2 = CheckQueue();
		bool r3 = CheckPriority_queue();
		if (r1 && !r2 && !r3) cout << "stack" << endl;
		else if (!r1 && r2 && !r3) cout << "queue" << endl;
		else if (!r1 && !r2 && r3) cout << "priority queue" << endl;
		else if (!r1 && !r2 && !r3) cout << "impossible" << endl;
		else cout << "not sure" << endl;
	}
	return 0;
}