用C++解决旧式火车站车厢排序步数计算问题

```cpp #include <iostream> using namespace std; int main() { int n; cin >> n; int cars[100]; for (int i = 0; i < n; i++) { cin >> cars[i]; } int steps = 0; // 冒泡排序思想，交换相邻元素 for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - i - 1; j++) { if (cars[j] > cars[j + 1]) { swap(cars[j], cars[j + 1]); steps++; } } } cout << steps << endl; return 0; } ``` ######[AI问答 | 202点数解答 | 2026-04-12 19:23:27]