CareerCup Find 3 indexes i,j,k such that, i<j<k and a[i] < a[j] < a[k]

Given a array of integers , find 3 indexes i,j,k such that, i<j<k and a[i] < a[j] < a[k]. Best possible is a O(n) algorithm.

---------------------------------------------------------------

This question is answered in the Amazon questions 

a[i]<a[j]<a[k] s.t i<j<k 
From the original array build two arrays. 
i) LMin[i] contains index of the min element seen so far from the left including a[i]. 
ii) RMax[i] contains index of the max element seen so far from the right including a[i]. 
consider the following array: 
a =4,7,5,1,3,8,9,6,2 
LMin=0,0,0,3,3,3,3,3,3 
RMax=6,6,6,6,6,6,6,7,8 


Now for i=1 to n if a[LMin[i]] < a[i] < a[RMax[i] print LMin[i],a[i],RMax[i] 
Time complexity: O(n) 
Space Complexity: O(n)

BUT I think there's better solution without extra space.