老哥我T2和你思路一样，为啥一个case都过不了啊 #include <bits/stdc++.h> using namespace std; int main() { int n; long long num; vector<long long> nums; long long oddMax=-1, evenMax = -1; while (cin >> n) { int res = 0; nums = vector<long long>(n, 0); for (int i = 0; i < n; ++i) { cin >> num; nums[i] = num; if (i%2 == 0) evenMax = evenMax > num ? evenMax : num; else oddMax = oddMax > num ? oddMax : num; } for (int i = 0; i < n; ++i) { if (i%2 == 0) { res += (evenMax-nums[i]); } else { res += (oddMax - nums[i]); } } if (evenMax == oddMax) res += (n/2); cout << res << endl; } }