寻找数组平衡点下标的算法实现

```cpp #include <iostream> using namespace std; const int MAXN = 100005; int a[MAXN], sum[MAXN]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; sum[i] = sum[i - 1] + a[i]; } for (int i = 1; i <= n; i++) { int leftSum = sum[i - 1]; int rightSum = sum[n] - sum[i]; if (leftSum == rightSum) { cout << i << endl; return 0; } } return 0; } ``` ######[AI问答 | 192点数解答 | 2026-05-30 19:36:12]