Exercise

I've found the following problem in the laboratory at school:

A vector X with n integer numbers is given. Write a Pascal program that computes and prints the longuest sequence X[i], X[i+1], ..., X[f] such that all the elements are mutually distinct.