Submission #1422590

---

Source Code Expand

#include <iostream>
#include <cmath>
#define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++)
#define INF (1LL << 60)
using namespace std;
typedef long long ll;

int N;
ll A[200000];

int main(void) {
  cin >> N;
  REP(i, 0, N) cin >> A[i];

  ll sum = 0;
  REP(i, 0, N) sum += A[i];

  ll s = 0;
  ll ans = INF;
  REP(i, 0, N - 1) {
    s += A[i];
    ans = min(ans, abs(s - (sum - s)));
  }
  cout << ans << endl;
}

Submission Info

Judge Result