第二题没啥说的。居然一遍过一脸蒙蔽。 #include <iostream> #include <cmath> #include <string> #include <set> #include <string.h> #include <algorithm> #include <vector> #include <map> #include <stack> #include <queue> #define MAXX (10000) using namespace std; int main() { int n; while (cin >> n) { vector<int> v; for (int i = 0; i < n; i++) { int t; cin >> t; v.push_back(t); } int count = 1; for (int i = 0; i < n - 1; i++) { if (v[i] != v[i + 1]) count += 1; } if (v[0] == 0) count += 1; if (count % 2 == 0) { cout << "Bob" << endl; } else { cout << "Alice" << endl; } } }