3 sequential numbers

Alright geniuses, if you think your programming ability is up to par, lets see you solve this:

Write an algorithm which in O(n) time finds 3 indices i, j, and k such that i < j < k and array[i] < array[j] < array[k].

this is an interesting problem. I think I will work onp a divide and conqueur algorithm and will bump in 2 weeks, just incase it is a homework thread.