Submission #882386

---

Source Code Expand

/*
	Swamy Saranam

	Date	: 14/09/2016 22:45:26
	Author	: Krishna Mohan A M
	Problem	:
	Status	:
*/
#include <bits/stdc++.h>

using namespace std;

typedef long double ld;

typedef long long ll;
typedef pair<int,int>	pii;
typedef pair<ld,ld>	pdd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef pair<ll,ll> pl;

#define FASTIO          ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#define FOR(i,a,b)		for(int i=(a);i<(b);i++)
#define REP(i,n)		FOR(i,0,n)
#define SORT(v)			sort((v).begin(),(v).end())
#define UN(v)			SORT(v),(v).erase(unique((v).begin(),(v).end()),(v).end())
#define CL(a,b)			memset(a,b,sizeof a)
#define pb				push_back
#define x               first
#define y               second
#define endl            "\n"
#define sendl           " \n"

const int mod = 1000000007;
ll n, tmp;
ll ans;
vector<ll> dat;

int main()
{
    FASTIO
    cin>>n;
    dat.resize(n+3, 0);
    REP(i, n){
      cin>>dat[i+1];
      //ans += tmp/2;
    }
    REP(i, dat.size()-1){
      ans += dat[i]/2;
      dat[i]%=2;
      if(dat[i]&&dat[i+1]){
        ans++;
        --dat[i];
        --dat[i+1];
      }
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result