https://blog.youkuaiyun.com/cjk_cjkzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/cjk_cjk/article/details/46875599https://blog.youkuaiyun.com/cjk_cjk/article/details/46875599cjk_cjkTue, 14 Jul 2015 11:42:39 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46869177https://blog.youkuaiyun.com/cjk_cjk/article/details/46869177cjk_cjkMon, 13 Jul 2015 22:59:02 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46855453https://blog.youkuaiyun.com/cjk_cjk/article/details/46855453cjk_cjkMon, 13 Jul 2015 00:45:55 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46855289https://blog.youkuaiyun.com/cjk_cjk/article/details/46855289cjk_cjkMon, 13 Jul 2015 00:20:27 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46834479https://blog.youkuaiyun.com/cjk_cjk/article/details/46834479cjk_cjkFri, 10 Jul 2015 19:55:59 +0800s = o->ch[0]->s + 1 + o->ch[1]->s 操作，一定要考虑此问题 【代码】 #include #include int ans=0; struct Node { Node* ch[2]; int v,r,s; int cmp_v(int x) const { if(x==v) r]]>https://blog.youkuaiyun.com/cjk_cjk/article/details/46760025https://blog.youkuaiyun.com/cjk_cjk/article/details/46760025cjk_cjkSun, 05 Jul 2015 08:08:16 +0800B，容量无穷大，将s与所有正权点相连，所有负权点与t相连，容量都为点权的绝对值 还要注意若A,B互相保护，即图上有环，或环能保护一个点，则它们都不可能取！预处理时把它们都删掉。这个预处理只需记录入度，拓扑排序即可。再注意，千万别把s和t也考虑进]]>https://blog.youkuaiyun.com/cjk_cjk/article/details/46688505https://blog.youkuaiyun.com/cjk_cjk/article/details/46688505cjk_cjkMon, 29 Jun 2015 23:09:20 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46684409https://blog.youkuaiyun.com/cjk_cjk/article/details/46684409cjk_cjkMon, 29 Jun 2015 17:14:41 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46681371https://blog.youkuaiyun.com/cjk_cjk/article/details/46681371cjk_cjkMon, 29 Jun 2015 13:45:47 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46675525https://blog.youkuaiyun.com/cjk_cjk/article/details/46675525cjk_cjkSun, 28 Jun 2015 23:30:49 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46656529https://blog.youkuaiyun.com/cjk_cjk/article/details/46656529cjk_cjkSat, 27 Jun 2015 02:28:46 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46644305https://blog.youkuaiyun.com/cjk_cjk/article/details/46644305cjk_cjkFri, 26 Jun 2015 03:22:50 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46644299https://blog.youkuaiyun.com/cjk_cjk/article/details/46644299cjk_cjkFri, 26 Jun 2015 03:06:05 +0800v与Ej:v->w(w!=u)，都有 Y[i][j]=1 此时Y[i][j]=1的意义是：从边i的末端]]>https://blog.youkuaiyun.com/cjk_cjk/article/details/46644235https://blog.youkuaiyun.com/cjk_cjk/article/details/46644235cjk_cjkFri, 26 Jun 2015 03:04:29 +0800  重要的性质 所]]>https://blog.youkuaiyun.com/cjk_cjk/article/details/46630529https://blog.youkuaiyun.com/cjk_cjk/article/details/46630529cjk_cjkThu, 25 Jun 2015 01:50:53 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46625079https://blog.youkuaiyun.com/cjk_cjk/article/details/46625079cjk_cjkWed, 24 Jun 2015 18:09:24 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46620601https://blog.youkuaiyun.com/cjk_cjk/article/details/46620601cjk_cjkWed, 24 Jun 2015 12:44:53 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46611107https://blog.youkuaiyun.com/cjk_cjk/article/details/46611107cjk_cjkTue, 23 Jun 2015 22:29:45 +0800https://blog.youkuaiyun.com/cjk_cjk/article/details/46595819https://blog.youkuaiyun.com/cjk_cjk/article/details/46595819cjk_cjkMon, 22 Jun 2015 21:03:57 +0800H表示由o及其左右子树所对应字母构成的字符串的Hash值， 则 o->H = o->ch]]>https://blog.youkuaiyun.com/cjk_cjk/article/details/46594153https://blog.youkuaiyun.com/cjk_cjk/article/details/46594153cjk_cjkMon, 22 Jun 2015 16:37:31 +0800