CF432 D - Arpa and a list of numbers

枚举每种可能的gcd，对于每种gcd利用前缀和快速求出代价。将整个数轴按gcd划分，每个区间中的数要么满足条件，要么需要删掉（index%gcd< gcd-A/B），要么往前加(index%gcd>gcd-A/B)

#include<bits/stdc++.h>
#define ll long long
#define N 2000009
using namespace std;

int n,A,B,a[N]; ll s[N];
int main(){
    scanf("%d%d%d",&n,&A,&B);
    int i,j,k,p=A/B;
    for (i=1; i<=n; i++){
        scanf("%d",&j);
        a[j]++; s[j]+=j;
    }
    for (i=1; i<=2000000; i++){
        a[i]+=a[i-1]; s[i]+=s[i-1];
    }
    ll ans=(ll)n*A;
    for (i=2; i<=1000000; i++){
        ll tmp=0;
        for (j=i; j<=1000000+i && tmp<ans; j+=i){
            k=max(j-i+1,j-p);
            tmp+=((ll)(a[j]-a[k-1])*j-(s[j]-s[k-1]))*B;
            tmp+=(ll)(a[k-1]-a[j-i])*A;
        }
        ans=min(ans,tmp);
    }
    printf("%lld\n",ans);
    return 0;
}