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

```cpp #include <iostream> #include <stack> using namespace std; int main() { int n; cin >> n; int arr[n]; stack<int> s; for (int i = 0; i < n; i++) { cin >> arr[i]; } int num = 1; string res = ""; for (int i = 0; i < n; i++) { while (num <= arr[i]) { s.push(num); res += "a"; num++; } if (s.top() == arr[i]) { s.pop(); res += "b"; } } cout << res << endl; return 0; } ``` ######[AI写代码神器 | 183点数解答 | 2024-11-17 09:15:57]