Submission #844831

---

Source Code Expand

#include <bits/stdc++.h>

#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))

using namespace std;

typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;

template<typename P, typename Q>
ostream& operator << (ostream& os, pair<P, Q> p)
{
  os << "(" << p.first << "," << p.second << ")";
  return os;
}

int main(int argc, char *argv[])
{
  const int N = 100000 + 5;
  lli a[N];

  int n;
  while (cin >> n) {
    fill(a, a + N, 0);
    for (int i = 0; i < n; ++i) {
      cin >> a[i];
    }
    lli cnt = 0;
    for (int i = 0; i + 1 < N; ++i) {
      int j = i + 1;
      int mn = min(a[i], a[j]);
      a[i] -= mn;
      a[j] -= mn;
      cnt += mn;
    }
    for (int i = 0; i < N; ++i) {
      cnt += a[i] / 2;
    }
    cout << cnt << endl;
  }
  return 0;
}

Submission Info

Judge Result