poj2181 hdu2713 Jumping Cows

#include<iostream>
#include<cstdio>
using namespace std;
int n,a,f[150005][2];
int main(){
	int i,j;
	while(scanf("%d",&n)!=EOF){
		memset(f,0,sizeof(f));
		scanf("%d",&f[1][1]);
		for(i=2;i<=n;i++){
			scanf("%d",&a);
			f[i][0]=max(f[i-1][0],f[i-1][1]-a);
			f[i][1]=max(f[i-1][1],f[i-1][0]+a);
		}
		printf("%d\n",f[n][1]);
	}
	return 0;
}