(I7
I138
I149
(dp0
Vmetro.%l
p1
(Vmetro.cpp
p2
S'#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<vector>\n#include<iomanip>\n#include<stack>\n#include<queue>\nusing namespace std;\nint main()\n{\r\n    long long int n,m;\r\n    cin>>n>>m;\r\n    long long int *p= new long long int[m];\r\n    for(long long int i=0;i<m;i++)cin>>p[i];\n    long long int a,b;\r\n    cin>>a>>b;\r\n    long long int min=10003,mini,min1=10003,mini1;\r\n    long long int sum1=0,sum2=0;\r\n    sum2=b-a;\r\n    for(long long int i=0;i<m;i++)\r\n    {\r\n        long long int l=a>p[i]?a-p[i]:p[i]-a;\r\n        if(l<min)\r\n        {\r\n            min=l;\r\n            mini=i;\r\n        }\r\n    }\r\n    for(long long int i=0;i<m;i++)\r\n    {\r\n        long long int l=b>p[i]?b-p[i]:p[i]-b;\r\n        if(l<min1)\r\n        {\r\n            min1=l;\r\n            mini1=i;\r\n        }\r\n    }\r\n    sum1=sum1+(mini1-mini)*2;\r\n    sum1+=min1;\r\n    sum1+=min;\r\n    if(sum2<sum1)\r\n    {\r\n        sum1=sum2;\r\n    }\r\n    cout<<sum1<<endl;\r\n\nreturn 0;\n}\r\n'
p3
tp4
stp5
.