Submission #63597752

---

Source Code Expand

#include "bits/stdc++.h"
#include <chrono>
using namespace std;

#define LL long long
#define mod 998244353ll
//#define mod 1000000007ll
#define PI acos(-1.0)
#define set0(ar) memset(ar, 0, sizeof ar)
#define setinf(ar) memset(ar, 126, sizeof ar)

inline LL bigmod(LL p, LL e, LL M) {
  LL r = 1;
  for (; e > 0; e >>= 1, p = (p * p) % M)
    if (e & 1) r = (r * p) % M;
  return r;
}
inline LL modinverse(LL a, LL M) { return bigmod(a, M - 2, M); }

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

LL ar[200001];
void solve() {
  int n; cin >> n;
  for(int i = 1; i <= n; i++) cin >> ar[i];
  if(n == 1) {
    cout << ar[1] << endl;
    return;
  }
  LL sum[2];
  sum[n%2] = ar[n];
  sum[(n-1)%2] = 0;
  for(int i = n-1; i >= 1; i--) {
    sum[i%2] = max(sum[i%2], ar[i] + sum[1-(i%2)]);
  }
  cout << sum[1] << endl;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int T = 1;
  //cin >> T; 
  for (int ts = 1; ts <= T; ts++) {
    //cout << "Case " << ts << ": ";
    solve();
  }
}

Submission Info

Judge Result