最大覆盖问题:给定n 个整数n a , a , ,a 1 2  组成的序列，试设计一个O(n)时间算法，计算其最大覆盖 区间长度。-Maximum cover problem: Given n integers na, a,, a 1 2  composed of a sequence and try to design an O (n) time algorithm to calculate the maximum length of coverage ran

符号平衡问题:给定n 个整数n a , a , ,a 1 2  组成的序列，试设计一个O(n)时间算法，计算其最长符号 平衡段的长度。-Symbol balance: Given n integers na, a,, a 1 2  composed of a sequence and try to design an O (n) time algorithm to calculate the balance of the longest segment of t

No presente trabalho sã o apresentados o modelo Matemático e metodologia numérica para a soluç ã o do problema clássico do escoamento tridimensional incompressível em uma cavidade com tampa deslizante. Na soluç ã o numérica fo

蚁群算法的优化，以改善传统的蚁群算法不适用欲大规划的TSP问题的解决，缩短搜索的时间。-Ant colony optimization algorithm to improve the traditional ant colony algorithm NA For big plan to solve TSP problem, shorten the time of the search.