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].

I'm wondering what I should do for input like [5, 6, 1, 2, 7].

Should I always reset the first element so long as there are at least two spaces left after?

>>19

Oops, of course.