//include //------------------------------------------ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; // typedef //------------------------------------------ typedef long long LL; typedef vector VI; typedef vector VB; typedef vector VC; typedef vector VD; typedef vector VS; typedef vector VLL; typedef vector VVI; typedef vector VVB; typedef vector VVS; typedef vector VVLL; typedef vector VVVI; typedef vector VVVLL; typedef pair PII; typedef pair PLL; typedef pair PIS; typedef pair PSI; typedef pair PSS; typedef vector VPII; typedef vector VPLL; typedef vector VVPII; typedef vector VVPLL; typedef vector VVS; typedef map MII; typedef map MLL; typedef map MSI; typedef map MIS; // container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define SZ(a) int((a).size()) #define EACH(i, arr) for(typeof((arr).begin()) i=(arr).begin(); i!=(arr).end(); ++i) #define EXIST(str, e) ((str).find(e)!=(str).end()) #define COUNT(arr, v) count((arr).begin(), (arr).end(), v) #define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end()) #define SORT(c) sort((c).begin(),(c).end()) #define RSORT(c) sort((c).rbegin(),(c).rend()) #define REVERSE(c) reverse((c).begin(), (c).end()) #define ROTATE_LEFT(arr, c) rotate((arr).begin(), (arr).begin()+(c), (arr).end()) #define ROTATE_RIGHT(arr, c) rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend()) #define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0) #define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.) #define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL) #define MULD(arr) accumulate((arr).begin(), (arr).end(), 1., multiplies()) #define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n) #define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n) #define PB push_back #define MP make_pair #define ft first #define sd second // input output //------------------------------------------ #define GL(s) getline(cin, (s)) #define INIT() std::ios::sync_with_stdio(false);std::cin.tie(0) #define OUT(d) std::cout<<(d) #define OUT_L(d) std::cout<<(d)< istream &operator>>(istream &in, pair &p) { in >> p.first >> p.second; return in; } template istream &operator>>(istream &in, vector &v) { for (auto &x: v) in >> x; return in; } template ostream &operator<<(ostream &out, const std::pair &p) { out << "[" << p.first << ", " << p.second << "]" << "\n"; return out; } template inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true; } return false; } //repetition //------------------------------------------ #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) FOR(i,0,n) #define RREP(i, n) for(int i = n-1;i >= 0;i--) #define FORLL(i, a, b) for(LL i=LL(a);i=LL(a);--i) #define REPLL(i, n) for(LL i=0;i=0;--i) #define FOREACH(x, arr) for(auto &(x) : (arr)) //------------------------------------------ //------------------------------------------ template class CulSum { private: long long N; vector a; vector aa; vector b; vector bb; function func; public: /// @param a original array CulSum(vector _a) { N = _a.size(); a = _a; b = _a; reverse(b.begin(), b.end()); this->aa = vector(N + 1, T{}); this->bb = vector(N + 1, T{}); for (int i = 0; i < N; i++) aa[i + 1] = a[i] + aa[i]; for (int i = 0; i < N; i++) bb[i + 1] = b[i] + bb[i]; } /// @param a original array CulSum(vector _a, function func) : func(func) { N = _a.size(); a = _a; b = _a; reverse(b.begin(), b.end()); this->aa = vector(N + 1, T{}); this->bb = vector(N + 1, T{}); for (int i = 0; i < N; i++) aa[i + 1] = func(a[i], aa[i]); for (int i = 0; i < N; i++) bb[i + 1] = func(b[i], bb[i]); } /// @brief 0-index original /// @param l original close /// @param r original open T get_sum(int l, int r) { return aa[r] - aa[l]; } /// @brief 0-index original /// @param l original close /// @param r original open T get_sum_reverse(int l, int r) { l = N - l; r = N - r; return bb[l] - bb[r]; } /// @brief 0-index original /// @param k length T get_sum_lead_k_len(int k) { return get_sum(0, k); } /// @brief 0-index original /// @param k length T get_sum_tail_k_len(int k) { return get_sum_reverse(N - k, N); } void show() { for (int i = 0; i < N + 1; i++) cout << aa[i] << " "; cout << endl; } void show_reverse() { for (int i = N; i >= 0; i--) cout << bb[i] << " "; cout << endl; } }; int main() { int N; cin >> N; VLL A(2 * N); cin >> A; VLL B(N), C(N); for (int i = 0; i < N; i++)B[i] = A[i * 2]; for (int i = 0; i < N; i++) C[i] = A[i * 2 + 1]; CulSum sb(B), sc(C); LL ans = -1e18; for (int i = 0; i <= N; i++) { LL homu = sb.get_sum_lead_k_len(i) + sc.get_sum_tail_k_len(N - i); LL tem = sc.get_sum_lead_k_len(i) + sb.get_sum_tail_k_len(N - i); ans = max(ans, homu - tem); } cout << ans << endl; }