https://blog.youkuaiyun.com/qyfl806zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/qyfl806/article/details/62881725https://blog.youkuaiyun.com/qyfl806/article/details/62881725qyfl806Fri, 17 Mar 2017 09:58:59 +0800https://blog.youkuaiyun.com/qyfl806/article/details/62422710https://blog.youkuaiyun.com/qyfl806/article/details/62422710qyfl806Thu, 16 Mar 2017 14:32:54 +0800Aj的数对(i,j)的个数。给1到n的一个排列，按照某种顺序依次删除m个元素，你的任务是在每次删除一个元素之前统计整个序列的逆序对数。 Input 输入第一行包含两个整数n和m，即初始元素的个数和删除的元素个数。以下n行每行包含一个1到n之间的正整数，即初始排列。以下m行每行一个正整数，依次]]>https://blog.youkuaiyun.com/qyfl806/article/details/62422280https://blog.youkuaiyun.com/qyfl806/article/details/62422280qyfl806Thu, 16 Mar 2017 14:07:16 +0800https://blog.youkuaiyun.com/qyfl806/article/details/61921233https://blog.youkuaiyun.com/qyfl806/article/details/61921233qyfl806Mon, 13 Mar 2017 17:07:49 +0800https://blog.youkuaiyun.com/qyfl806/article/details/61197666https://blog.youkuaiyun.com/qyfl806/article/details/61197666qyfl806Fri, 10 Mar 2017 15:16:50 +0800