摘要：
A.B.C.D.Good Sequences题意：从一个递增数字序列中找出一串最长的序列满足任意相邻的数字不互质。分析：The main idea is DP. Let's definedp[x]as the maximal value of the length of the good sequence whose last element isx, and defined[i]as the (maximal value ofdp[x]wherexis divisible byi).You should calculatedp[x]in the increasing order of 阅读全文
