摘要: The frequent subset problem is defined as follows. Suppose U={1, 2,…\ldots…,N} is the universe, and S1S_{1}S​1​​, S2S_{2}S​2​​,…\ldots…,SMS_{M}S​M​​ a 阅读全文
posted @ 2017-09-24 20:59 starry_sky 阅读(231) 评论(0) 推荐(0)
摘要: Let S be a sequence of integers s1s_{1}s​1​​, s2s_{2}s​2​​, ........., sns_{n}s​n​​ Each integer is is associated with a weight by the following rules 阅读全文
posted @ 2017-09-24 20:57 starry_sky 阅读(242) 评论(0) 推荐(0)
摘要: There are nnn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might overlap with 阅读全文
posted @ 2017-09-24 20:53 starry_sky 阅读(224) 评论(0) 推荐(0)
摘要: You are given a list of train stations, say from the station to the station 100. The passengers can order several tickets from one station to another 阅读全文
posted @ 2017-09-24 20:50 starry_sky 阅读(283) 评论(0) 推荐(0)