Template Function ADS::longestChainSubsequence

• Defined in File SequenceProblems.h

Function Documentation

template<class T, class Less>
std::vector<std::size_t> ADS::longestChainSubsequence(const std::vector<T> &S, Less less)

the places of a longest subsequence of S each item of which precedes the next by less, a strict partial order

Post:

increasing places, less on each two consecutive items