题目是：找一个二维数组中的鞍点，即该位置上的元素在该行上最大，在该列上最小。也可能没有鞍点
#include<stdio.h>
void main()
{
        int max(int (*p)[4],int n);
        int a[3][4]={{1,2,3,4},{5,6,7,8},{9,10,11,12}};
        int s,t1,t2,t3;
        t1=max(a[0],0);
        t2=max(a[1],1);
        t3=max(a[2],2);
        s=t1+t2+t3;
        if(s==3)
        printf("no");
}
int max(int (*p)[4],int n)
{int i,t,s1,s2,q,g;
t=0;
g=0;
    for(i=0;i<4;i++)
    {       if(*(*(p)+i)>t)
            {t=*(*(p)+i);
            q=i;
            }
    }
        if(n==0)s1=1,s2=2;
       else if(n==1)s1=0,s2=2;
        else if(n==2)s1=0,s2=1;
        if(*(*(p)+q)<*(*(p+s1)+q)&&*(*(p)+q)<*(*(p+s2)+q))
        printf("%d",*(*(p)+q));
        else
        g=g+1;
        return(g);
}