https://blog.youkuaiyun.com/kkkkahluazh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/kkkkahlua/article/details/78178368https://blog.youkuaiyun.com/kkkkahlua/article/details/78178368kkkkahluaSun, 08 Oct 2017 22:59:22 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/78063441https://blog.youkuaiyun.com/kkkkahlua/article/details/78063441kkkkahluaFri, 22 Sep 2017 15:30:03 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/78056716https://blog.youkuaiyun.com/kkkkahlua/article/details/78056716kkkkahluaThu, 21 Sep 2017 20:47:34 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/78047116https://blog.youkuaiyun.com/kkkkahlua/article/details/78047116kkkkahluaThu, 21 Sep 2017 00:23:07 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/78045056https://blog.youkuaiyun.com/kkkkahlua/article/details/78045056kkkkahluaWed, 20 Sep 2017 20:26:58 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/78037018https://blog.youkuaiyun.com/kkkkahlua/article/details/78037018kkkkahluaWed, 20 Sep 2017 09:32:50 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/78034793https://blog.youkuaiyun.com/kkkkahlua/article/details/78034793kkkkahluaTue, 19 Sep 2017 21:25:08 +0800 #define maxn 100010 using namespace std; typedef]]>https://blog.youkuaiyun.com/kkkkahlua/article/details/78034066https://blog.youkuaiyun.com/kkkkahlua/article/details/78034066kkkkahluaTue, 19 Sep 2017 20:14:07 +0800 #define maxn 10]]>https://blog.youkuaiyun.com/kkkkahlua/article/details/78033391https://blog.youkuaiyun.com/kkkkahlua/article/details/78033391kkkkahluaTue, 19 Sep 2017 18:58:23 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/78031993https://blog.youkuaiyun.com/kkkkahlua/article/details/78031993kkkkahluaTue, 19 Sep 2017 16:57:08 +0800a[j]↔b[i]>b[j]\forall i,j,1\leq i,j\leq n,\begin{eqnarray}\begin{cas]]>https://blog.youkuaiyun.com/kkkkahlua/article/details/78009087https://blog.youkuaiyun.com/kkkkahlua/article/details/78009087kkkkahluaSun, 17 Sep 2017 11:18:37 +0800(0≤i(0\leq i\lt j\lt n)，有一条 i→ji\rightarrow j 边，流量为 i Xor ji\ Xor\ j，问从 00 到 n−1n-1 的最大流。思路首先，00 到 n−1n-1 必须要割；其次，对于任意一个 ii，0→i0\rightarrow]]>https://blog.youkuaiyun.com/kkkkahlua/article/details/77994912https://blog.youkuaiyun.com/kkkkahlua/article/details/77994912kkkkahluaFri, 15 Sep 2017 19:20:47 +0800\gt max{max\{其中第一个与前一个的公共前缀，其中最后一个与后一个的公共前缀}\}，差值即为这一段的个数。遍历一遍统计即可，最小值用 rmqrmq。注意 k=1k=1]]>https://blog.youkuaiyun.com/kkkkahlua/article/details/77990117https://blog.youkuaiyun.com/kkkkahlua/article/details/77990117kkkkahluaFri, 15 Sep 2017 13:39:45 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/77978524https://blog.youkuaiyun.com/kkkkahlua/article/details/77978524kkkkahluaThu, 14 Sep 2017 11:38:41 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/77973192https://blog.youkuaiyun.com/kkkkahlua/article/details/77973192kkkkahluaThu, 14 Sep 2017 08:21:27 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/77902390https://blog.youkuaiyun.com/kkkkahlua/article/details/77902390kkkkahluaSat, 09 Sep 2017 01:06:44 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/77900569https://blog.youkuaiyun.com/kkkkahlua/article/details/77900569kkkkahluaFri, 08 Sep 2017 23:36:36 +0800& prices) { int n = prices.siz]]>https://blog.youkuaiyun.com/kkkkahlua/article/details/77859897https://blog.youkuaiyun.com/kkkkahlua/article/details/77859897kkkkahluaTue, 05 Sep 2017 23:16:21 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/77854160https://blog.youkuaiyun.com/kkkkahlua/article/details/77854160kkkkahluaTue, 05 Sep 2017 17:41:14 +0800https://blog.youkuaiyun.com/kkkkahlua/article/details/77853562https://blog.youkuaiyun.com/kkkkahlua/article/details/77853562kkkkahluaTue, 05 Sep 2017 17:03:43 +0800