<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dcc1117的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dcc1117</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dcc1117]]></copyright><item><title><![CDATA[LCA tarjan 离线算法学习]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163225</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163225</guid><author>dcc1117</author><pubDate>Tue, 08 May 2012 13:48:00 +0800</pubDate><description><![CDATA[最近公共祖先(Least Common Ancestors)LCA
定义：对于有根树T的两个结点u、v，最近公共祖先LCA(T,u,v)表示一个结点x，满足x是u、v的祖先且x的深度尽可能大。另一种理解方式是把T理解为一个无向无环图，而LCA(T,u,v)即u到v的最短路上深度最小的点。
离线算法Tarjan:
　　利用并查集优越的时空复杂度，我们可以实现LCA问题的O(n+Q)...]]></description><category></category></item><item><title><![CDATA[书写是为了更好的思考 转]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163224</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163224</guid><author>dcc1117</author><pubDate>Mon, 07 May 2012 20:12:00 +0800</pubDate><description><![CDATA[书写是为了更好的思考

BY刘未鹏
–FEBRUARY 9, 2009POSTED IN:学习方法,思维改变生活

我经常在走路和睡前总结所学过的内容，思考遗留的问题，一段时间的阅读和思考之后，一个总体的知识框架就会逐渐浮现在脑海中。然后我会将它书写下来，然而，我往往非常惊讶地发现，当我书写的时候，新的内容仍然源源不断的冒出来，就像我的键盘自己也会思考一样。
大半年...]]></description><category></category></item><item><title><![CDATA[博弈论 转]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163223</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163223</guid><author>dcc1117</author><pubDate>Fri, 04 May 2012 17:15:00 +0800</pubDate><description><![CDATA[博弈论若你想仔细学习博弈论，我强烈推荐加利福尼亚大学的Thomas S. Ferguson教授精心撰写并免费提供的这份教材，它使我受益太多。（如果你的英文水平不足以阅读它，我只能说，恐怕你还没到需要看“博弈论”的时候。）Nim游戏是博弈论中最经典的模型（之一？），它又有着十分简单的规则和无比优美的结论，由这个游戏开始了解博弈论恐怕是最合适不过了。Nim游戏是组合游戏(Combina...]]></description><category></category></item><item><title><![CDATA[博弈论总结 转]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163221</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163221</guid><author>dcc1117</author><pubDate>Fri, 04 May 2012 16:44:00 +0800</pubDate><description><![CDATA[博弈论(理论知识)

博弈论：是二人或多人在平等的对局中各自利用对方的策略变换自己的对抗策略，达到取胜目标的理论。博弈论是研究互动决策的理论。博弈可以分析自己与对手的利弊关系，从而确立自己在博弈中的优势，因此有不少博弈理论，可以帮助对弈者分析局势，从而采取相应策略，最终达到取胜的目的。
博弈论分类：（摘自百度百科）
（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮...]]></description><category></category></item><item><title><![CDATA[hdu Junk-Mail Filter 并查集的合并与删除]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163222</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163222</guid><author>dcc1117</author><pubDate>Thu, 03 May 2012 20:41:00 +0800</pubDate><description><![CDATA[Junk-Mail Filter
Time Limit: 15000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3547Accepted Submission(s): 1079
Problem Description
Recognizing j...]]></description><category></category></item><item><title><![CDATA[poj Cow Relays 矩阵乘法思想与floyd]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163219</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163219</guid><author>dcc1117</author><pubDate>Thu, 03 May 2012 19:30:00 +0800</pubDate><description><![CDATA[Cow Relays




Time Limit:1000MS

Memory Limit:65536K


Total Submissions:3507

Accepted:1388




Description

For their physical fitness program,N(2 ≤N≤ 1,000,000) c...]]></description><category></category></item><item><title><![CDATA[最远曼哈顿距离]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163220</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163220</guid><author>dcc1117</author><pubDate>Wed, 02 May 2012 22:21:00 +0800</pubDate><description><![CDATA[求最远曼哈顿距离，对于一个n维的空间，其中两点的曼哈顿距离为：|x1-y1|+|x2-y2|+|x3-y3|+|x4-y4|+……+|xn-yn| （两点的坐标分别为（x1,x2,……,xn）、（y1,y2,……,yn））
 以下以二维平面为例研究：  
设距离最远的两点为i,j，可知所求的最大距离必定有以下四种形式之一： 
(xi-xj)+(yi-yj)...]]></description><category></category></item><item><title><![CDATA[poj Purifying Machine 判定两个二进制串是否相差一位]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163201</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163201</guid><author>dcc1117</author><pubDate>Wed, 02 May 2012 21:49:00 +0800</pubDate><description><![CDATA[Purifying Machine
Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 1 Accepted Submission(s) : 1
Problem Description
Mike is the owner ...]]></description><category></category></item><item><title><![CDATA[hdu 无题II 二分+枚举+最大匹配]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163200</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163200</guid><author>dcc1117</author><pubDate>Tue, 01 May 2012 21:28:00 +0800</pubDate><description><![CDATA[无题II   Time Limit : 2000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)  Total Submission(s) : 11 Accepted Submission(s) : 7  Problem Description  这是一个简单的游戏，在一个n*n的矩阵中，找n个数使得这n个数都在不...]]></description><category></category></item><item><title><![CDATA[hdu Jamie's Contact Groups 二分+二分图多重匹配]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163202</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163202</guid><author>dcc1117</author><pubDate>Tue, 01 May 2012 18:46:00 +0800</pubDate><description><![CDATA[Jamie's Contact Groups  Time Limit: 15000/7000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)    Total Submission(s): 171 Accepted Submission(s): 46       Problem Description  J...]]></description><category></category></item><item><title><![CDATA[Windows Live Writer 真的这么神奇吗？]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163217</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163217</guid><author>dcc1117</author><pubDate>Tue, 01 May 2012 16:38:00 +0800</pubDate><description><![CDATA[第一次使用WLW来写博客园的日志，不知道效果怎么样，
#include &lt;stdio.h&gt;
#include &lt;string.h&gt;
int main(){
	printf("hello world!\n");
	return 0;
}




各种测试
orz



仰慕Windows这些工程师啊

转载于:https://ww...]]></description><category></category></item><item><title><![CDATA[hdu Swap]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163218</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163218</guid><author>dcc1117</author><pubDate>Tue, 01 May 2012 15:55:00 +0800</pubDate><description><![CDATA[Swap
Time Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 3Accepted Submission(s) : 2
Special Judge
Problem Description
Given an N*N matr...]]></description><category></category></item><item><title><![CDATA[hdu Strategic Game 二分图最大匹配/树形DP]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163215</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163215</guid><author>dcc1117</author><pubDate>Tue, 01 May 2012 13:22:00 +0800</pubDate><description><![CDATA[Strategic Game
Time Limit : 20000/10000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 4Accepted Submission(s) : 3
Problem Description
Bob enjoys playing c...]]></description><category></category></item><item><title><![CDATA[hdu Rain on your Parade 二分图最大匹配]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163213</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163213</guid><author>dcc1117</author><pubDate>Tue, 01 May 2012 12:30:00 +0800</pubDate><description><![CDATA[Rain on your Parade
Time Limit : 6000/3000ms (Java/Other)Memory Limit : 655350/165535K (Java/Other)
Total Submission(s) : 3Accepted Submission(s) : 2
Problem Description
You’re giving a...]]></description><category></category></item><item><title><![CDATA[hdu Arbiter 二分图的另一种用途]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163211</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163211</guid><author>dcc1117</author><pubDate>Tue, 01 May 2012 11:31:00 +0800</pubDate><description><![CDATA[Arbiter
Time Limit : 1000/1000ms (Java/Other)Memory Limit : 131072/131072K (Java/Other)
Total Submission(s) : 2Accepted Submission(s) : 2
Problem Description
Arbiter is a kind of starsh...]]></description><category></category></item><item><title><![CDATA[hdu Taxi Cab Scheme]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163209</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163209</guid><author>dcc1117</author><pubDate>Tue, 01 May 2012 10:40:00 +0800</pubDate><description><![CDATA[Taxi Cab Scheme
Time Limit : 20000/10000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 3Accepted Submission(s) : 3
Problem Description
Running a taxi stat...]]></description><category></category></item><item><title><![CDATA[hdu I'm Telling the Truth]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163216</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163216</guid><author>dcc1117</author><pubDate>Tue, 01 May 2012 10:04:00 +0800</pubDate><description><![CDATA[I'm Telling the Truth
Time Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 2Accepted Submission(s) : 2
Problem Description
After this year...]]></description><category></category></item><item><title><![CDATA[hdu fire net 经典的二分图匹配]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163206</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163206</guid><author>dcc1117</author><pubDate>Mon, 30 Apr 2012 13:58:00 +0800</pubDate><description><![CDATA[Fire Net Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 3   Accepted Submission(s) : 3Problem DescriptionSuppose that we have a square city ...]]></description><category></category></item><item><title><![CDATA[hdu National Treasures 二分图的最小点集覆盖]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163214</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163214</guid><author>dcc1117</author><pubDate>Mon, 30 Apr 2012 12:07:00 +0800</pubDate><description><![CDATA[National Treasures Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 4   Accepted Submission(s) : 3Problem DescriptionThe great hall of the nat...]]></description><category></category></item><item><title><![CDATA[hdu Marriage Match II 完全不同的最大匹配方案的个数]]></title><link>https://blog.youkuaiyun.com/dcc1117/article/details/102163203</link><guid>https://blog.youkuaiyun.com/dcc1117/article/details/102163203</guid><author>dcc1117</author><pubDate>Mon, 30 Apr 2012 09:22:00 +0800</pubDate><description><![CDATA[Marriage Match II
Time Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 6Accepted Submission(s) : 5
Problem Description
Presumably, you all...]]></description><category></category></item></channel></rss>