Nice DP Problem

Правка en1, от jhjfbsbfkbjfnfnfjfj, 2020-04-24 07:23:12

I have studied about finding LIS (longest increasing subsequence) How do I extend that knowledge to find LIS where gcd(xi, xi+1) > 1? Please help me here is the link to the question https://mirror.codeforces.com/problemset/problem/264/B

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский jhjfbsbfkbjfnfnfjfj 2020-04-24 07:23:12 245 Initial revision (published)