题目描述
Recently,Nero is researching a kind of sequence problem related to the sphere.This kind of problem ressembles the Longest Ascending Subsequence.
For instance,Given a sequence,can you find the longest subsequence in it?
Following constraints should be meeted:
1:the elements in the subsequence should be totally equal.
2:the interval between the adjacent elements in the subsequence shouldn't be greater than one(in the hint,we'll show clearly what the interval is)