C++实现：根据目标编组顺序输出火车编组进栈出栈操作序列

```cpp #include <iostream> #include <stack> #include <vector> using namespace std; string trainReorder(int n, vector<int> order) { stack<int> s; int cur = 1; string result = ""; for (int i = 0; i < n; i++) { while (!s.empty() && s.top() == order[i]) { s.pop(); result += "b"; i++; } if (cur <= n) { s.push(cur); result += "a"; cur++; } } return result; } int main() { int n; cin >> n; vector<int> order(n); for (int i = 0; i < n; i++) { cin >> order[i]; } cout << trainReorder(n, order) << endl; return 0; } ``` ######[AI写代码神器 | 461点数解答 | 2024-11-17 09:09:53]