2017 icpc 南宁网络赛
Posted hk lin
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了2017 icpc 南宁网络赛相关的知识,希望对你有一定的参考价值。
2000年台湾大专题。。。英语阅读输入输出专场。。我只能说很强势。。
The frequent subset problem is defined as follows. Suppose UU={1, 2,\ldots…,N} is the universe, and S_{1}S?1??, S_{2}S?2??,\ldots…,S_{M}S?M?? are MM sets over UU. Given a positive constant \alphaα, 0<\alpha \leq 10<α≤1, a subset BB (B \neq 0B≠0) is α-frequent if it is contained in at least \alpha MαM sets of S_{1}S?1??, S_{2}S?2??,\ldots…,S_{M}S?M??, i.e. \left | \left \{ i:B\subseteq S_{i} \right \} \right | \geq \alpha M∣{i:B?S?i??}∣≥αM. The frequent subset problem is to find all the subsets that are α-frequent. For example, let U=\{1, 2,3,4,5\}U={1,2,3,4,5}, M=3M=3, \alpha =0.5α=0.5, and