It is up to you to define what your primitive operations are, and you should count separately per primitive type.
For instance, you might count the loop iterations (
n
), the array accesses (
n
), the comparisons to the maximum (
n-1
), and/or the value assignments (
m
, the number of so called "left-to-right maxima", in range [0..n]).
Counts are usually kept separate for clearer accounting and also because you don't want to assign every operation a specific number of processor clocks.
In practice, it is often the case that you focus on only one type of operation that describes the overall behavior of the algorithm. In your example, you would probably consider the number of comparisons to the maximum, all the rest being proportional or less.
This is in relation with the notion of asymptotic complexity
http://en.wikipedia.org/wiki/Asymptotic_computational_complexity[
^].