#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int n,slin,scol,elin,ecol;
int l[1000005];
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>slin>>scol>>elin>>ecol;
ecol--;
scol--;
for(int i=1;i<=n;i++)
cin>>l[i];
int rez=INF;
for(int le=min(slin,elin);le>=1;le--)
{
for(int ri=max(slin,elin);ri<=n;ri++)
{
int mnm=INF,pm,um;
for(int i=le;i<=ri;i++)
{
if(l[i] < mnm)
{
mnm = l[i];
pm = um = i;
}
else if(l[i] == mnm)
um = i;
}
int aux=0;
aux += ri-le;
aux += min(slin,elin) - le;
aux += ri - max(slin,elin);
rez = min(rez, aux + abs(ecol - min(scol, mnm)));
rez = min(rez, aux + scol + abs(mnm - ecol) + (ri == pm));
if(scol <= mnm) rez = min(rez, aux + (mnm - scol) + 1 + ecol + (le == um));
if(scol > mnm) rez = min(rez, aux + 1 + ecol + (le == um));
}
}
cout<<rez;
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... |