Numeric sequences often exhibit similar behaviors or trends, such as fluctuations in electrocardiograms and stock values that resemble waves. This paper attempts to find the longest common almost wave subsequence between two numeric sequences A and B within at most r segments. This new problem is a more generalized variant of the longest increasing subsequence and the longest wave subsequence problems. We present the formal definition of this new problem, and propose an efficient algorithm to solve it. With this new theoretical result, it may be helpful to study related real-world problems, such as fluctuations in electrocardiograms or stock price prediction.