Submission #1683442

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;

#define INF_LL (ll)1e18
#define INF (int)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
using ll = long long;
using PII = pair<int, int>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

#define fs first
#define sc second

int main(void){
	int N;
	int A[114514];
	cin >> N;
	REP(i, N)
		cin >> A[i];
	A[N] = 0;
	int res = 0;
	REP(i, N){
		res += A[i]/2;
		A[i] %= 2;
		if(A[i] && A[i+1]){
			A[i+1]--;
			A[i]--;
			res++;
		}
	}
	cout << res << endl;
}

Submission Info

Judge Result