Codeforces Round #782 (Div. 2) Probelm C Line Empire

题目

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+5;
const int inf=0x3f3f3f3f;
typedef long long ll;
typedef pair<int,int> PII;
ll s[maxn];
void solve()
{
   ll n,a,b;
    cin>>n>>a>>b;
    for(int i=1;i<=n;i++)
        cin>>s[i];
    int l=0,r=n;
    while(l<r)
    {
       ll mid=l+r>>1;
        if(b*(n-mid)>(a+b))
        {
             l=mid+1;
        }
        else
        {
            r=mid;
        }
    }
    ll ans=(a+b)*abs(s[l]-s[0]);
    for(int i=l+1;i<=n;i++)
        ans+=b*abs(s[l]-s[i]);
    cout<<ans<<endl;

}



int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
}