Submission #1588733

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main(){
        ll N, a, b;
        cin>>N>>a>>b;
        vector <ll> x;
        for(ll i=0;i<N;i++){
                ll xx;
                cin>>xx;
                x.push_back(xx);
        }
        ll res=0;
        ll now=0, now2=N-1;
        bool def=false;
        while(now!=now2){
                if(!def&&a*abs(x[now+1]-x[now])<b){
                        res+=abs(x[now+1]-x[now]);
                        now++;
                }
                else if(def&&a*abs(x[now2]-x[now2-1])<b){
                        res+=abs(x[now2]-x[now2-1]);
                        now2--;
                }
                else{
                        res+=b;
                        if(def){
                                def=false;
                                now++;
                        }
                        else{
                                def=true;
                                now2--;
                        }
                }
                //cout<<now<<":"<<now2<<endl;
        }
        cout<<res<<endl;
        return 0;
}

Submission Info

Judge Result