#include<bits/stdc++.h>
#define MAXN 1007
using namespace std;
int n;
int srow,scol,erow,ecol;
int h[MAXN];
int minh[MAXN][MAXN];
long long ans;
long long go_straight(int r1,int c1,int r2,int c2){
return abs(r1-r2) + abs( min(c1,minh[min(r1,r2)][max(r1,r2)]) - c2);
}
int main(){
cin>>n;
cin>>srow>>scol;
cin>>erow>>ecol;
for(int i=1;i<=n;i++){
cin>>h[i];
h[i]++;
}
for(int i=1;i<=n;i++){
minh[i][i]=h[i];
for(int f=i+1;f<=n;f++){
minh[i][f]=min(h[f],minh[i][f-1]);
}
}
ans=go_straight(srow,scol,erow,ecol);
for(int i=1;i<=n;i++){
if(i>1)ans=min(ans , go_straight(srow,scol,i,1) + go_straight(i-1,h[i-1],erow,ecol) );
if(i<n)ans=min(ans , go_straight(srow,scol,i,h[i]) + 1 + go_straight(i+1,1,erow,ecol) );
ans=min(ans , go_straight(srow,scol,i,h[i]) + go_straight(i,h[i],erow,ecol) );
}
cout<<ans<<"\n";
return 0;
}
# | 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... |