1000ms 262144K In this problem, we will define a graph called star graph, and the question is to find the minimum distance between two given nodes in the star graph. Given an integer nn, an n-dimen
1000ms 131072K The frequent subset problem is defined as follows. Suppose U={1, 2,…,N} is the universe, and S1, S2,…,SM are M sets over U. Given a positive constant α, 0<α≤1, a subset B (B≠0) is
1000ms 131072K Let S be a sequence of integers s1, s2, ......, sn Each integer is associated with a weight by the following rules: (1) If is negative, then its weight is 0. (2) If is greater th