Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define ll long long
- using namespace std;
- int main() {
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- int n;
- cin >> n;
- vector<ll>v(n);
- for (int i=0; i<n; i++) {
- cin >> v[i];
- }
- vector<ll>ps(n);
- for (int i=0; i<n; i++) {
- ps[i]=v[i];
- if (i) ps[i]+=ps[i-1];
- }
- vector<ll>ss(n);
- for (int i=n-1; i>=0; i--) {
- ss[i]=v[i];
- if (i<n-1) ss[i]+=ss[i+1];
- }
- set<ll>s;
- priority_queue<ll>p;
- for (int i=0; i<n; i++) {
- for (int j=n-1; j>i; j--) {
- if (ss[j]==ps[i]) p.push(ps[i]);
- }
- }
- cout << p.top() << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment