Given n numbers from o file calculate the maximum product that we can get with any three numbers.
Using of vectors or arrays is not accepted.
Numbers (int) from file could be negative positive or even zeros.

What's the easiest method to solve this?
I was thinking about some possible cases: when all numbers are positive, negative, zeros but there are more like when there are positives and negatives together