Known array: a[max]; divide a[] into four sections: a[0] - a[x], a[x+1] - a[y], a[y+1] - a[z], a[z+1] - a[max-1].
And 0<x<y<z<max-1; a[] is an integer greater than 0; Solve integers x, y and z, to meet the following requirements: Sum = (a[0 ]+ ... +a[x] )* x + (a[x+1]+ ... +a[y] )* y + (a[y+1]+ ... +a[z] )* z + (a[z+1]+ ... +a[max-1])*(max) choosing x, y, z such that the value of sum is the least. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---