文件名称:101
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:723byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
若矩阵Am×n中的某个元素aij是第i行中的最小值,同时又是第j列中的最大值,则称此元素为该矩阵中的一个马鞍点。假设以二维数组存储矩阵Am×n ,试编写求出矩阵中所有马鞍点的算法。
注意一行(列)中可能有多个最小(大)值
可用下列矩阵进行测试:
1 2 3 1 1 1
4 7 6 2 2 2
7* 7* 9 3* 3* 3* (*表示马鞍点)
-If the matrix Am × n aij is an element in the i-th row of the minimum, but it is also the maximum value of the j-th column, this element of the matrix called a saddle point. Assuming a two-dimensional array to store the matrix Am × n, find test preparation for all saddle-point matrix algorithm. Note that a row (column) in the smallest possible number of (large) value can be used to test the following matrix: 1231114762227* 7* 9 3* 3* 3* (* indicates the saddle point)
注意一行(列)中可能有多个最小(大)值
可用下列矩阵进行测试:
1 2 3 1 1 1
4 7 6 2 2 2
7* 7* 9 3* 3* 3* (*表示马鞍点)
-If the matrix Am × n aij is an element in the i-th row of the minimum, but it is also the maximum value of the j-th column, this element of the matrix called a saddle point. Assuming a two-dimensional array to store the matrix Am × n, find test preparation for all saddle-point matrix algorithm. Note that a row (column) in the smallest possible number of (large) value can be used to test the following matrix: 1231114762227* 7* 9 3* 3* 3* (* indicates the saddle point)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
101.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.