HDU - 5036 Explosion(期望+bitset)【存疑】
Soda has a bipartite graph with nn vertices and mm undirected edges. Now he wants to make the graph become a complete bipartite graph with most edges by adding some extra edges. Soda needs you to tell
原创
2017-08-09 16:56:08 ·
384 阅读 ·
0 评论