Codility's MaxCounters Coding Interview - Part 4 

If anybody is looking for performant solution with caching max value (not applying it every time we encounter "max counter" operation - it's very time consuming) there you have it: vector solution(int N, vector &A) { std::vector counters(N, 0); int max_val = 0; bool apply_max = false; for (int operation : A) { if (operation max_val) { max_val = cur_val; apply_max = true; } } else { if (apply_max) { std::fill(counters.begin(), counters.end(), max_val); apply_max = false; } } } return counters; }

I still don't get it. How would this work and what's the rationale for it? What's the intuition for this? Update: nvm I found out part 3. Basically idea is that when the time comes, we 'save' the 'column' they are all supposed to be in (i.e. the leading/furthest position) and update those who are below the 'column' later, AFTER everything is done. Otherwise those after the 'column' should proceed as per normal. This works because it doesn't matter the positions before the 'column' as we don't care about it.

clear explanation great video, patiently waiting for the next video :)