L = min(A);
f = find(diff([false,A==L,false])~=0);
h = L*max(f(2:2:end)-f(1:2:end-1));
h is the highest sum of consecutive lowest values.
[Note: You should be careful how your fractions are generated. You might have, say, two consecutive values which appear equal to the minimum value, .2, .2, but which are not exactly equal. These would not be detected as part of a consecutive sequence of least values.]