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

Are you people for real?  The O(n) algorithm is trivial and you guys keep jerkin' it over how you've improved your shitty O(n^3) solution.