-
Notifications
You must be signed in to change notification settings - Fork 35
/
1006C - Three Parts of the Array.cpp
97 lines (88 loc) · 2 KB
/
1006C - Three Parts of the Array.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
/*Saurav Paul*/
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define loop(i,a,b) for(ll i=a;i<=b;++i)
#define boost ios_base::sync_with_stdio(0);
#define eb emplace_back
#define itoc(c) ((char)(((int)'0')+c))
#define ctoi(c) ((int)(((int)c)-'0'))
#define all(p) p.begin(),p.end()
#define bug() debug() <<
using namespace std;
///////////////////////
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef PAUL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define dbg(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#ifdef ONLINE_JUDGE
#define cerr if (false) cerr
#endif
void time(){
#ifdef PAUL
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
///////////////////////
const int INF = 1e9 + 99;
using ll = long long int ;
using pii = pair<int,int >;
using vec = vector<int> ;
void brut(vector<ll> &v){
int n = v.size();
ll mx = 0;
int i = 0 , j = n-1;
ll x = v[i] , y = v[j];
while(i < j){
debug() << dbg(i) dbg(j) dbg(mx) dbg(x) dbg(y);
if(x==y){
mx = max(mx,x);
i ++;
x += v[i];
}
else if(x < y){
i ++;
x += v[i];
}
else{
j --;
y += v[j];
}
}
printf("%lld\n",mx);
}
int main()
{
int n;
scanf("%d",&n);
vector<ll> v(n);
for(int i = 0; i < n; i++){
scanf("%lld",&v[i]);
}
brut(v);
time();
return 0;
}