... Maximum Subarray(DP, 最大连续之和) Permutation Sequence(康托展开) Minimum Path Sum(DP,空间压缩) ...
基于1个网页-相关网页
Put forward a planner permutation network by using the ergodic and good relativity of Chebyshev-map chaos sequence, and the time complexity and analyzed permutation character of permutation network.
利用混沌序列的遍历性及其良好的相关特性，提出了一种二维置换网络，并对置换网络的时间复杂度和其置换性质做了分析。
The key of the problem is how to reflect the permutation information of a character sequence.
问题的关键是如何反映字符序列的排列信息。
应用推荐