[求助]一个简单算法的实现？？

[meatball1982]

clear all
clc
A=[0 0 0 0 0 3.5 4.7 0 0 0 8 0 9.0 4.5 6.5 9];
n=length(A);
A=[A,0];
k=1;
if A(1)==0;
temp=[];
else
temp=A(1);
end
for i=1:n
if A(i)~=0
temp=[temp,A(i)];
if A(i+1)==0
temp_out(k)=sum(temp)*max(temp);
temp=[];
k=k+1;
end
end
end
out=sum(temp_out)
(3.5+4.7)*max([3.5,4.7])+8*8+(9.0+4.5+6.5+9)*max([9.0, 4.5, 6.5,9])