could you explain me test and answer? i can't understand how this situation may happen

finally i understood the problem. solution is much easier than it's problem.
the problem's solution is very easy:
to find min: min[i] = i -count of a[j] where{j<i and a[j]>a[i]}
to find max: max[i] = n -count of a[j] where{j>i and a[j]>a[i]}
good luck!

Much more harger and so important is to prove the result.

here is my solution, i don't know why it is not correct and i always wa at #6

lowest:

min[i] = count of a[j] where{j>i and a[j]<a[i]} + 1

highest:

max[i] = n - count of a[j] where{j<i and a[j]>a[i]}

i need some help, thx.

Edited by author 28.10.2008 08:15

I think there are some mistakes in your code.
For other: Don't look at this code. Think yourself (As I) :)

You are right,that anwer got Wa6