ZOJ Problem Set - 1201 Inversion (Python)
摘要：
ZOJ Problem Set - 1201Inversion Time Limit: 1 Second Memory Limit: 32768 KB Let { A1,A2,...,An } be a permutation of the set{ 1,2,..., n}. If i < j and Ai > Aj then the pair (Ai,Aj) is called an "inversion" of the permutation. For example, the permutation {3, 1, 4, 2} has three inversions: ( 阅读全文
posted @ 2011-02-17 13:56 天下之大 阅读(445) 评论(0) 推荐(0) 编辑
