Submission #1191185

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<cstdlib>
#include<list>
#include<set>
#include<numeric>

#define MOD 1000000007

using namespace std;
typedef long long ll;
typedef pair<int, int> P;

ll A[100010];

int main(void)
{
	int N;
	cin >> N;

	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}

	int ans = 0;
	for (int i = 0; i < N; i++) {
		ans += A[i] / 2;
		if (A[i] % 2 != 0) {
			if (A[i + 1] % 2 != 0) {
				ans++;
				A[i + 1]--;
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result