If and take time each, MO's total complexity becomes .
For example, if you're maintaining a sorted structure with insert/delete: Total time: This is still often better than naive approach.
But for tight limits, consider if a different technique (like merge sort tree or persistent segment tree) would be faster. The beauty of MO's is its flexibility. Any problem with efficient extend/shrink operations can use it.