Join the social network of Tech Nerds, increase skill rank, get work, manage projects...
 

find the longest sub-arraythat all of its elements are less or equalA[i]

I have an array A[1,...,n] of positive numbers, for example: [1, 2, 5, 3, 7, 2, 8, 4] I need to build an array S[1,...,n] according to the definition: S[i] = max {k|ik <ji :A[j] A[i] and k i} It means ...
Sign In
                           OR                           
                           OR                           
Register

Sign up using

                           OR                           
Forgot Password
Fill out the form below and instructions to reset your password will be emailed to you:
Reset Password
Fill out the form below and reset your password: