I'll take a stab.. but only pseudo, not going to try and write it all out in proper syntax.
I'd start by running a for loop that runs through each mc in your array and checks the distance from the x/y of each mc to the x/y of the mouse, using the Pythagorean theorem. If you are okay with it checking the center point of your mcs, it will be easier.. if you want it to check to the outside edge of the mcs, that would be tougher. You'd have to perform a series of hit tests I'd imagine along the path between the mouse and movieclip until one equated to true.
I would create two variables, one for the current distance being checked and one for your highest distance. The first time the for loop plays, it would enter the first distance checked as your current highest value. Each subsequent time it runs, it would need to check if the current distance between movieclip and mouse is higher than the value of the highest distance variable; if so, it would replace that variable with the current distance checked.
After the for loop completes, you'd need to run a check to see what the highest value was..
Alternatively - though I don't know if this is possible - you could store all the distances from the for loop mentioned above in a separate array.. if you can then reorganize the array in order from lowest value to highest, that would be perfect, you can then just trace the last value in the array. I'm pretty sure you can sort arrays alphabetically, so this may just be possible. Definitely would be cleaner.
Keep in mind this is all just theory, so someone else could maybe chime in if I'm off here.