Code javascript:

Find the maximum number of nonintersecting segments of length with equal sums in a given array of integers.

Task description

You are given an array A of integers. Find the maximum number of nonintersecting segments of length two adjacent elements such that segments have an equal sum.

For example, given A there are three nonintersecting segments, each whose sum is equal to : Another three nonintersecting segments are:

Write a function:

function solutionA;

that, given an array A of N integers, returns the maximum number of segments with equal sums.

Examples:

Given A the function should return as explained above.

Given A the function should return Each sum of two adjacent elements is different from the others.

Given A the function should return

Given A the function should return There are three segments: whose sums are equal to

Write an efficient algorithm for the following assumptions:

N is an integer within the range ;

each element of array A is an integer within the range