![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
sicily
文章平均质量分 67
HowardLin
这个作者很懒,什么都没留下…
展开
-
最小生成树
Description Given n nodes in a two-dimensional space, we want to use single-link custering method to find k clusters. This is equivalent to finding an MST (Minimum spanning tree) of these nodes and de原创 2016-03-24 16:57:54 · 432 阅读 · 0 评论 -
the number of position
Description Jesse stands in line of n people, but he doesn’t know exactly which position he occupies. He can say that there are no less than A people standing in front of him and no less than B people原创 2016-04-14 10:17:14 · 432 阅读 · 0 评论 -
LIS 求最小的最长递增子序列
Description A numeric sequence of ai is ordered if a1 <= a2 <= … <= aN. Let the subsequence of the given numeric sequence (a1, a2, …, aN) be any sequence (ai1, ai2, …, aiK), where 1 <= i1 < i2 < … < i原创 2016-04-11 10:39:24 · 592 阅读 · 0 评论 -
sicily Tiling a Grid With Dominoes
题意: 问一个 L*4 的矩形,用2*1的小矩形组成有多少种组法。思路: 递推。用一个4bit的整数表示“行状态”。写出15个递推式即可。首先,定义 f [ i ] [ j ] 为, 已组成长度 (i - 1)* 4 的完美矩形, 第 i 行的状态是 j (0~15)的方案数。那么我们可以考察 f [ i ] [ j ] 可以怎么求得。注意下面的状态方程的推导,围绕的思路不仅是要填满 15(1转载 2016-06-06 11:44:05 · 453 阅读 · 0 评论