subchains专题

POJ 1341 The Strongest Subchains 笔记

给出N,a1,a2,a3,M,s1,s2,s3,e1,e2,e3。N元数组A,A[i] = (a1*i *i + a2*i + a3) mod 9973 。M元数组S,S[i] = (s1*i*i+ s2*i + s3) mod (N/2) 。M元数组E,E[i] = S[i] + [(e1*i*i+ e2*i + e3) mod (N/2)]。M元数组R,R[i] = min{A[S[i