Submission #847034

---

Source Code Expand

#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int N;
	cin >> N;
	vector<int> A(N);
	long long sum =0;
	for(int i =0; i < N; i++) {
		cin >> A[i];
		sum +=A[i];}
	vector<long long> pE(N+1,-sum-tisic),pO(N+1,-sum-tisic);
	pE[0] =0;
	for(int i =0; i < N; i++) {
		if(A[i] == 0) {
			pE[i+1] =pE[i];
//			cout << pE[i+1] << "\n";
			continue;}
		pO[i+1] =max((A[i]-1)/2+pE[i],A[i]/2+pO[i]);
		pE[i+1] =max(A[i]/2+pE[i],(A[i]+1)/2+pO[i]);
		pE[i+1] =max(pE[i+1],pO[i+1]);
//		cout << pO[i+1] << " " << pE[i+1] << "\n";
		}
	cout << max(pE[N],pO[N]) << "\n";
	return 0;}

// look at my code
// my code is amazing

Submission Info

Judge Result