Problem1996--Sort Three Distinct Keys

1996: Sort Three Distinct Keys

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 0  Solved: 0
[Submit] [Status] [Web Board] [Creator:]

Description

Suppose you have an array of N elements, containing three distinct keys,

Input

where ElementType A[] contains the N elements.

Output

see in samples

Sample Input Copy 

6
2 2 0 1 0 0

Sample Output Copy 

false in A[0]-A[0]
maybe in A[1]-A[2]
true in A[3]-A[5]

Source/Category

158 
[Submit] [Status]