https://blog.youkuaiyun.com/linulysseszh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/linulysses/article/details/6369983https://blog.youkuaiyun.com/linulysses/article/details/6369983linulyssesThu, 28 Apr 2011 16:25:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/6341984https://blog.youkuaiyun.com/linulysses/article/details/6341984linulyssesFri, 22 Apr 2011 16:02:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/6336336https://blog.youkuaiyun.com/linulysses/article/details/6336336linulyssesWed, 20 Apr 2011 16:04:00 +0800题目链接：http://poj.org/problem?id=1740
题意：小明和小红参加一种新的取石子游戏。游戏开始时有 n 堆石子，参与游戏的两个选手轮流取走和移动石子，游戏从小明开始。在每一轮中，选手选择一个至少有一颗石子的堆，从该堆石子中拿走至少一个石子。接着，该选手可以多次地从该堆中剩下的石子中把任意多的个石子移动到任意的堆中。当然，该选手也可以不移动任何石子。但是，必须注意，选手必须从该选中的堆中取起至少一块石子。因此，随着游戏的进行，石子越来越少。当轮到某选手时，已经没]]>https://blog.youkuaiyun.com/linulysses/article/details/5820916https://blog.youkuaiyun.com/linulysses/article/details/5820916linulyssesWed, 18 Aug 2010 14:24:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5802934https://blog.youkuaiyun.com/linulysses/article/details/5802934linulyssesWed, 11 Aug 2010 06:48:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5797782https://blog.youkuaiyun.com/linulysses/article/details/5797782linulyssesMon, 09 Aug 2010 03:44:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5771084https://blog.youkuaiyun.com/linulysses/article/details/5771084linulyssesWed, 28 Jul 2010 13:51:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5744445https://blog.youkuaiyun.com/linulysses/article/details/5744445linulyssesSun, 18 Jul 2010 16:15:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5688248https://blog.youkuaiyun.com/linulysses/article/details/5688248linulyssesWed, 23 Jun 2010 08:43:00 +0800问题描述： 阿兰是某机密部门的打字员，她现在接到一个任务：需要在一天之内输入几百个长度固定为6的密码。当然，她希望输入的过程中敲击键盘的总次数越少越好。
不幸的是，出于保密的需要，该部门用于输入密码的键盘是特殊设计的，键盘上没有数字键，而只有以下六个键：Swap0, Swap1, Up, Down, Left, Right，为了说明这6个键的作用，我们先定义录入区的6个位置的编号，从左至右依次为1，2，3，4，5，6。下面列出每个键的作用：
Swap0：按]]>https://blog.youkuaiyun.com/linulysses/article/details/5635520https://blog.youkuaiyun.com/linulysses/article/details/5635520linulyssesMon, 31 May 2010 05:26:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5634104https://blog.youkuaiyun.com/linulysses/article/details/5634104linulyssesSun, 30 May 2010 08:03:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5625707https://blog.youkuaiyun.com/linulysses/article/details/5625707linulyssesWed, 26 May 2010 16:13:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5622945https://blog.youkuaiyun.com/linulysses/article/details/5622945linulyssesTue, 25 May 2010 15:33:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5602679https://blog.youkuaiyun.com/linulysses/article/details/5602679linulyssesTue, 18 May 2010 08:56:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5598987https://blog.youkuaiyun.com/linulysses/article/details/5598987linulyssesMon, 17 May 2010 02:22:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5594141https://blog.youkuaiyun.com/linulysses/article/details/5594141linulyssesSat, 15 May 2010 06:53:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5559262https://blog.youkuaiyun.com/linulysses/article/details/5559262linulyssesWed, 05 May 2010 13:48:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5538774https://blog.youkuaiyun.com/linulysses/article/details/5538774linulyssesWed, 28 Apr 2010 14:19:00 +0800= m 。找出 str 中包含 must 中所有字符的最短子串。 最直接和简单的算法当然是暴力搜索(brute-force search)： minimal := str [0,...,n-1 ]for i]]>https://blog.youkuaiyun.com/linulysses/article/details/5538755https://blog.youkuaiyun.com/linulysses/article/details/5538755linulyssesWed, 28 Apr 2010 14:14:00 +0800https://blog.youkuaiyun.com/linulysses/article/details/5538731https://blog.youkuaiyun.com/linulysses/article/details/5538731linulyssesWed, 28 Apr 2010 14:09:00 +0800