https://blog.youkuaiyun.com/rootialzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/rootial/article/details/43939195https://blog.youkuaiyun.com/rootial/article/details/43939195rootialWed, 25 Feb 2015 18:10:04 +0800https://blog.youkuaiyun.com/rootial/article/details/38851219https://blog.youkuaiyun.com/rootial/article/details/38851219rootialTue, 26 Aug 2014 17:44:12 +0800https://blog.youkuaiyun.com/rootial/article/details/38851217https://blog.youkuaiyun.com/rootial/article/details/38851217rootialTue, 26 Aug 2014 17:44:09 +0800https://blog.youkuaiyun.com/rootial/article/details/38851213https://blog.youkuaiyun.com/rootial/article/details/38851213rootialTue, 26 Aug 2014 17:44:07 +0800https://blog.youkuaiyun.com/rootial/article/details/38851211https://blog.youkuaiyun.com/rootial/article/details/38851211rootialTue, 26 Aug 2014 17:44:05 +0800https://blog.youkuaiyun.com/rootial/article/details/38851209https://blog.youkuaiyun.com/rootial/article/details/38851209rootialTue, 26 Aug 2014 17:44:03 +0800aj,i 考虑ak,k = j-1; #11:ak > aj,那么ak,aj构成逆序对，交换后逆序对减少1； #12:ak 考虑ak,k = i+1; #21:ak #22:a]]>https://blog.youkuaiyun.com/rootial/article/details/38851207https://blog.youkuaiyun.com/rootial/article/details/38851207rootialTue, 26 Aug 2014 17:44:01 +0800https://blog.youkuaiyun.com/rootial/article/details/38851205https://blog.youkuaiyun.com/rootial/article/details/38851205rootialTue, 26 Aug 2014 17:43:59 +0800w的路径出现次数，以及S2在v->w出现的次数。 S1(x) = S0[1....x]，1 以S1为例，需要预处理出来u到根节点的路径上对应S0[i,j]序列出现的]]>https://blog.youkuaiyun.com/rootial/article/details/38851203https://blog.youkuaiyun.com/rootial/article/details/38851203rootialTue, 26 Aug 2014 17:43:57 +0800(n,m)->(0, m)->(n, 0) 2. (0,0)->]]>https://blog.youkuaiyun.com/rootial/article/details/38851201https://blog.youkuaiyun.com/rootial/article/details/38851201rootialTue, 26 Aug 2014 17:43:55 +0800https://blog.youkuaiyun.com/rootial/article/details/38851199https://blog.youkuaiyun.com/rootial/article/details/38851199rootialTue, 26 Aug 2014 17:43:52 +0800https://blog.youkuaiyun.com/rootial/article/details/38851195https://blog.youkuaiyun.com/rootial/article/details/38851195rootialTue, 26 Aug 2014 17:43:50 +0800https://blog.youkuaiyun.com/rootial/article/details/38851193https://blog.youkuaiyun.com/rootial/article/details/38851193rootialTue, 26 Aug 2014 17:43:48 +0800https://blog.youkuaiyun.com/rootial/article/details/38851191https://blog.youkuaiyun.com/rootial/article/details/38851191rootialTue, 26 Aug 2014 17:43:46 +0800https://blog.youkuaiyun.com/rootial/article/details/38851189https://blog.youkuaiyun.com/rootial/article/details/38851189rootialTue, 26 Aug 2014 17:43:44 +0800https://blog.youkuaiyun.com/rootial/article/details/38851187https://blog.youkuaiyun.com/rootial/article/details/38851187rootialTue, 26 Aug 2014 17:43:42 +0800= X. 对整个数组先求出sum[i]，表示前i个元素的和，然后依次求出以a[i]为起点的，总和>= X的最小长度， 每次考虑新元素a[i]时，将a[i]加入数组, pa[—q] = mp(sum[i], i),这样pa[q……….p]形成一段总和递增的序列，下标也是逐渐增大。 最后利用lower_bound函数求]]>https://blog.youkuaiyun.com/rootial/article/details/38851185https://blog.youkuaiyun.com/rootial/article/details/38851185rootialTue, 26 Aug 2014 17:43:40 +0800https://blog.youkuaiyun.com/rootial/article/details/38851183https://blog.youkuaiyun.com/rootial/article/details/38851183rootialTue, 26 Aug 2014 17:43:38 +0800https://blog.youkuaiyun.com/rootial/article/details/38851179https://blog.youkuaiyun.com/rootial/article/details/38851179rootialTue, 26 Aug 2014 17:43:35 +0800 #include #include #include #include #include #in]]>https://blog.youkuaiyun.com/rootial/article/details/38851175https://blog.youkuaiyun.com/rootial/article/details/38851175rootialTue, 26 Aug 2014 17:43:33 +0800 8 #include 9 #include 10 #include 11 #incl]]>