A - Functions again

                         A - Functions again
Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u   CodeForces 788A
Description
Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function f, which is defined as follows:


In the above formula, 1 ≤ l < r ≤ n must hold, where n is the size of the Main Uzhlyandian Array a, and |x| means absolute value of x. But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of f among all possible values of l and r for the given array a.
Input
The first line contains single integer n (2 ≤ n ≤ 105) — the size of the array a.
The second line contains n integers a1, a2, ..., an (-109 ≤ ai ≤ 109) — the array elements.
Output
Print the only integer — the maximum value of f.
Sample Input
Input
5
1 4 2 3 1
Output
3
Input
4
1 5 4 7
Output
6

代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,k,i,sum=0;
	int a,b;
	cin>>n>>k;
	for(i=0;i<n;i++)
	{
		cin>>a;
		if(a<=k)
			sum++;
		if(a>k)
		{
			b=a/k;
			if(a%k==0)
				sum+=b;
			else
				sum+=(b+1);
		}
		
	}
	b=sum/2;
	if(sum%2==0)
		cout<<b<<endl;
	else 
		cout<<b+1<<endl;
	
	
	return 0;
}