阅读背景:

CodeForces 485D思路

来源:互联网 

You are given a sequence a consisting of n integers. Find the maximum possible value of (integer remainder of ai divided by aj), where 1 ≤ i, j ≤ n and ai ≥ aj.You are given a sequence a consisting of n i




你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: