Im trying a few days now to find a way to calculate the optimized number of sums in an 1D array which is sorted by descending order. To be more specific I am giving an examp
