need the code for of the question given below

given an array of N integers, the cost of a range

$($

subarray

$)$

$$is defined as the sum of the values in the range squared. that is

$,$

$$if the sum of the values of the range is S

$,$

$$its cost is s

$^$

$2$

$.$

$$how will you determine the largest cost of any contiguous subareay within tha given array?