文件名称:dist
介绍说明－－下载内容均来自于网络，请自行研究使用
对于给定的m 个整数a 1 , a 2,… a i …a m 组成的向量A， |a i | <=m，和另一个由n个整数 组成的向量B， b1 , b 2,… b i… b n |bi | <=n,试设计一个O (m+n) 时间算法，
计算给定向量A和B的距离dist-For a given integer m of a 1, a 2, ... ai ... am composed of vector A, | ai | <= m, and another by an integer n-vector composed of B, b1, b 2, ... bi ... bn | bi | <= n, try to design a O (m+ n) time algorithm to calculate the amount of A and B orientation the distance dist
计算给定向量A和B的距离dist-For a given integer m of a 1, a 2, ... ai ... am composed of vector A, | ai | <= m, and another by an integer n-vector composed of B, b1, b 2, ... bi ... bn | bi | <= n, try to design a O (m+ n) time algorithm to calculate the amount of A and B orientation the distance dist
(系统自动生成,下载前可以参看下载内容)
下载文件列表
dist.cpp