最大团
凌晨四点的洛杉矶fly
这个作者很懒,什么都没留下…
展开
-
hdu1530(求最大团模板)
Given a graph G(V, E), a clique is a sub-graph g(v, e), so that for all vertex pairs v1, v2 in v, there exists an edge (v1, v2) in e. Maximum clique is the clique that has maximum number of vertex. ...原创 2019-01-23 19:51:37 · 378 阅读 · 0 评论 -
codeforces 622c(思维)
You are given array a with n integers and m queries. The i-th query is given with three integers li, ri, xi. For the i-th query find any position pi (li ≤ pi ≤ ri) so that api ≠ xi. Input The first...原创 2019-01-23 19:56:22 · 150 阅读 · 0 评论