void f(int a[],int l,int r) //l为数组左边界下标;r数组右边界下标;
{
int i,t;
for(i=l; i<=(r-l)/2+l; i++) //注意加l(左边界下标);
{
t=a[i]; //i-l为此时坐标与左边界距离;
a[i]=a[r-i+l]; //r-(i-l)为与右边界距离对应相同的坐标;
a[r-i+l]=t;
}
}