给你一个1 -> n的排列，现在有一次机会可以交换两个数的位置，求交换后最小值和最大值之间的最大距离是多少？

 1 //D

 2 #include<iostream>

 3 #include<cstdio>

 4 #include<algorithm>

 5 #include<cstring>

 6 #include<cstdlib>

 7 #include<string.h>

 8 #include<set>

 9 #include<vector>

10 #include<queue>

11 #include<stack>

12 #include<map>

13 #include<cmath>

14 using namespace std;

15 typedef long long ll;

16 const int INF=0x3f3f3f3f;

17 const int maxn=1e5+10;

18 double PI=acos(-1.0);

19 int a[maxn];

20 int main(){

21     int n;

22     while(~scanf("%d",&n)){

23         int maxx=-INF,minn=INF,pos1,pos2;

24         for(int i=1;i<=n;i++){

25             scanf("%d",&a[i]);

26             if(maxx<a[i]){maxx=a[i];pos1=i;}

27             if(minn>a[i]){minn=a[i];pos2=i;}

28         }

29         int ans1=max(abs(1-pos1),abs(n-pos1));

30         int ans2=max(abs(1-pos2),abs(n-pos2));

31         int ans=max(ans1,ans2);

32         printf("%d\n",ans);

33     }

34     return 0;

35 }