| 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. |
2010-01-18
Abonați-vă la:
Postare comentarii (Atom)
Absolute freedom needs an absolute void.
|
Niciun comentariu:
Trimiteți un comentariu