使用C++模拟草原蛇决斗并计算最终存活蛇的条数

```cpp #include <iostream> #include <vector> #include <algorithm> using namespace std; struct Snake { int id; int power; Snake(int i, int p) : id(i), power(p) {} // 重载小于运算符，用于排序 bool operator<(const Snake& other) const { if (power != other.power) { return power < other.power; } return id < other.id; } }; // 模拟决斗过程 int simulateDuel(vector<Snake>& snakes) { while (snakes.size() > 1) { sort(snakes.begin(), snakes.end()); Snake strongest = snakes.back(); Snake weakest = snakes.front(); // 检查最强的蛇吃了最弱的蛇后是否会成为最弱的蛇 bool willBeWeakest = false; vector<Snake> temp = snakes; temp.pop_back(); temp.erase(temp.begin()); temp.emplace_back(strongest.id, strongest.power - weakest.power); sort(temp.begin(), temp.end()); if (temp.front().id == strongest.id && temp.front().power == strongest.power - weakest.power) { willBeWeakest = true; } if (willBeWeakest) { break; } // 最强的蛇选择吃最弱的蛇 snakes.pop_back(); snakes.erase(snakes.begin()); snakes.emplace_back(strongest.id, strongest.power - weakest.power); } return snakes.size(); } int main() { int T; cin >> T; vector<Snake> snakes; for (int t = 0; t < T; ++t) { int k; if (t == 0) { int n; cin >> n; snakes.clear(); for (int i = 1; i <= n; ++i) { int power; cin >> power; snakes.emplace_back(i, power); } } else { cin >> k; for (int i = 0; i < k; ++i) { int x, y; cin >> x >> y; for (auto& snake : snakes) { if (snake.id == x) { snake.power = y; break; } } } } int result = simulateDuel(snakes); cout << result << endl; } return 0; } ``` 这段代码实现了蛇决斗的模拟过程。首先定义了 `Snake` 结构体来存储蛇的编号和体力值，并重载了小于运算符用于排序。`simulateDuel` 函数模拟了决斗的过程，在每一轮中，检查最强的蛇吃了最弱的蛇后是否会成为最弱的蛇，如果会则决斗结束，否则最强的蛇吃掉最弱的蛇继续下一轮。主函数中处理输入，对于每组数据，根据情况初始化或修改蛇的体力值，然后调用 `simulateDuel` 函数得到最终存活的蛇的条数并输出。 ######[AI问答 | 756点数解答 | 2026-03-28 12:51:01]