hdu 6200 mustedge mustedge mustedge
Problem Description
Give an connected undirected graph with n nodes
and m edges,
(n,m≤105)
which has no selfloops or multiple edges initially.
Now we have q operations
(q≤105):
⋅1 u
原创
2017-09-21 16:50:45 ·
438 阅读 ·
0 评论