B. Maximum Value（Codeforces Round #276(div1)_html/css_WEB-ITnose

33 4 5

<strong>找a[i]<a></a></strong>

<strong>由于ai</strong>

<strong>至于找最大模后的值，取a[i]==i也就是这个点存在，取模后的最大值肯定i+1+k*i,这样每次增加i查询，</strong>

<strong>查到离最大值最近的值。</strong>

<strong>代码：</strong>

<strong></strong><pre name="code" class="n">#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=2000000+100;int a[maxn];int main(){    int n;    scanf("%d",&n);    int x;    for(int i=0;i<n scanf a for i="0;i<maxn;i++)" if int ans="0;" j="i+i-1;j<maxn;j=j+i)">ans&&a[j]>i)                ans=a[j]%i;            }        }    }    printf("%d\n",ans);    return 0;}</n></algorithm></cstring></cstdio></iostream>