#include <bits/stdc++.h> using namespace std; int n,arr[100005]; int main(){ }

#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; }

终于，写出来了……（虽然是大循环里嵌俩小循环的劣质代码，但我还是激动到内牛满面）

无惧所谓真爱的背叛，坤家军永远在他身畔！ 发个题解,顺便拉几个正规军入伙(doge 废话不多说,直接上代码吧 虽然效率不是很高,但也能AC 另： 你愿意信C女士的话还是秦始皇复活

#include <bits/stdc++.h> using namespace std; int n,arr[100005]; int main(){ int ans = 0; cin >> n; for (int i = 0;i < n;i++){ cin >> arr[i]; ans += arr[i]; } int son1 = arr[0],son2 = arr[n - 1]; int l = 0,r = n - 1; int cur = ans - son1 - son2; if (son1 == son2) ans = cur; while(l < r){ if (son1 == son2) { ans = cur; l++; son1 += arr[l]; cur -= arr[l]; } while(l < r && son1 < son2){ l++; son1 += arr[l]; cur -= arr[l]; } while(l < r && son1 > son2){ r--; son2 += arr[r]; cur -= arr[r]; } } cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; int n,arr[100005]; int main(){ int ans = 0; cin >> n; for (int i = 0;i < n;i++){ cin >> arr[i]; ans += arr[i]; } int son1 = arr[0],son2 = arr[n - 1]; int l = 0,r = n - 1; int cur = ans - son1 - son2; if (son1 == son2) ans = cur; while(l < r){ if (son1 == son2) { ans = cur; l++; son1 += arr[l]; cur -= arr[l]; } while(l < r && son1 < son2){ l++; son1 += arr[l]; cur -= arr[l]; } while(l < r && son1 > son2){ r--; son2 += arr[r]; cur -= arr[r]; } } cout << ans; return 0; }

#include <bits/stdc++.h> using namespace std; int n,arr[100005]; int main(){ int ans = 0; cin >> n; for (int i = 0;i < n;i++){ cin >> arr[i]; ans += arr[i]; } int son1 = arr[0],son2 = arr[n - 1]; int l = 0,r = n - 1; int cur = ans - son1 - son2; if (son1 == son2) ans = cur; while(l < r){ if (son1 == son2) { ans = cur; l++; son1 += arr[l]; cur -= arr[l]; } while(l < r && son1 < son2){ l++; son1 += arr[l]; cur -= arr[l]; } while(l < r && son1 > son2){ r--; son2 += arr[r]; cur -= arr[r]; } } cout << ans; return 0; } 有帮助，赞一个