05:计算鞍点

11 3 5 6 9
12 4 7 8 10
10 5 6 9 11
8  6 4 7 2
15 10 11 20 25

4 1 8

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 using namespace std;
 5 #define max_ 0x7fff;
 6 int a[1001][1001];
 7 int maxn[1001];
 8 int minn[1001];
 9 int main()
10 {
11     for(int i=1;i<=1001;i++)
12     minn[i]=100001;
13     for(int i=1;i<=5;i++)
14     {
15         for(int j=1;j<=5;j++)
16         {
17             cin>>a[i][j];
18             if(a[i][j]>maxn[i])
19             {
20                 maxn[i]=a[i][j];
21             }
22             if(a[i][j]<minn[j])
23             {
24                 minn[j]=a[i][j];
25             }
26         }
27     }
28     for(int i=1;i<=5;i++)
29     {
30         for(int j=1;j<=5;j++)
31         {
32             if((a[i][j]==maxn[i])&&(a[i][j]==minn[j]))
33             {
34                 cout<<i<<" "<<j<<" "<<a[i][j];
35                 return 0;
36             }
37         }
38     }
39     cout<<"not found";
40     return 0;
41 }