最长递增子序列（LCS）

template<class Iter>
vector<typename iterator_traits<Iter>::value_type> LCS(Iter begin,Iter end)
{
typedef typename iterator_traits<Iter>::value_type Type;
int dis = distance(begin,end);
vector<int> temp(dis,1);
vector<Type> result;
vector<int> path(dis);
auto iter = begin;
int i = 0;
while(iter != end)
{
path[i] = i;
if(*iter > *begin)
{
path[i] = 0;
++temp[i];
}
++i;
++iter;
}
for(auto iter = begin;iter != end;++iter)
{
for(auto j = iter;j != begin;--j)
{
if(*iter > *j && temp[distance(begin,j)] >= temp[distance(begin,iter)])
{
temp[distance(begin,iter)] = temp[distance(begin,j)] + 1;
path[distance(begin,iter)] = distance(begin,j);
}
}
}


auto index = distance(temp.begin(),max_element(temp.begin(),temp.end()));
iter = begin;
advance(iter,index);
while(index != path[index])
{
result.insert(result.begin(),*iter);
index = path[index];
iter = begin;
advance(iter,index);
}
result.insert(result.begin(),*iter);
return move(result);
}