Alternating function

You are given an array $A$ of size $N.$

Lel's define a function, $F(t,r)=a_t-a_{t+1}+a_{f+2}$dots$+(-1{)}^{r-l}{a}_r.$ where $1lrN.$

Task

Divide the given array A into $)K(N$ contiguous subarrays such that:

If $K=1,$ then evaluate $F(1,N).$

Otherwise, $F(1,i_1)+F(i_1+1,i_2)+$dots$+F(i_{K-1}+1,N)$ is maximum, where $N=3=(1,2,3)1i_1.$

Print the maximum sum that can $be$ obtained.

Notes

Assume $1$ based indexing

Example

Assumptions

$N=3$

$=(1,2,3)$

static long maximumsum $($int N$,$int$[]$A$)$