寻找整数数组黄金分隔点的C++实现

```cpp #include <iostream> #include <vector> using namespace std; int main() { int n; cin >> n; vector<int> a(n); int total = 0; for (int i = 0; i < n; i++) { cin >> a[i]; total += a[i]; } int leftSum = 0; for (int i = 0; i < n; i++) { leftSum += a[i]; if (leftSum == 2 * (total - leftSum)) { cout << i + 1; return 0; } } cout << -1; return 0; } ``` ######[AI问答 | 189点数解答 | 2026-05-30 19:44:01]