#include <bits/stdc++.h>
#define endl '\n'
#define ld long double
#define pb push_back
#define pf push_front
#define mod 1000000007
#define se second
#define fi first
#define all(ls) (ls).begin(),(ls).end()
#define int long long
using namespace std;
void solve(){
int n,sl,sc,el,ec;
cin>>n>>sl>>sc>>el>>sc;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
int ans=1e18;
if(el>1)
ans=min(ans,abs(el-sl-1)+ec+a[0]+1-sc);
if(el<n-1)
ans=min(ans,abs(el-sl+1)-ec+a[0]+1+sc);
int tmp=2*n-sl-el;
cout<<min({ans,tmp+ec-1,tmp+a[0]+1-ec,abs(sc-ec)+abs(sl-el)})<<endl;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
// cin>>t;
for(int i=1;i<=t;i++){
// cout<<"Scenario #"<<i<<":"<<" ";
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |