This should do the trick. Note that you should use numel to count the number of elements, not length, which is just doing max(size(A)). The difference is usually nothing, but it will trip you up at some point.
B = [1, 4, 3, 1, 3, 2, 1, 0, 0, 1, 5, 6, 9, 1, 3];
A = cumsum (B);
C = zeros(size(A));
idx=find(A>=5);
while ~isempty(idx)
idx=idx(1);
C(idx)=A(idx);
A(idx:end)=A(idx:end)-A(idx);
idx=find(A>=5);
end
FormatSpec=[repmat('%d, ',1,numel(A)) '\n'];FormatSpec(end-3)='';
clc
fprintf(FormatSpec,A)
fprintf(FormatSpec,C)
Alternatively (which might be faster in some cases):
B = [1, 4, 3, 1, 3, 2, 1, 0, 0, 1, 5, 6, 9, 1, 3];
A = cumsum (B);
C = zeros(size(A));
idx=find(A>=5);
while ~isempty(idx)
idx=idx(1);
C(idx)=A(idx);
A=A-A(idx);
idx=find(A>=5);
end
A=cumsum(B)-cumsum(C);
Best Answer