Unordered set longest subsequence

#1

Why are we specifically using a set in this, can you elaborate please?

#2

amortised time complexity of unordered set is O(1) whereas for set is it is O(log(n)) ( for insertion ,deletion and find operation)

but in worst case ordered set performs better than unordered set