说明: Problem Descr iption There is an undirected graph G with n vertices and m edges. Every time, you can select several edges and delete them. The edges selected must meet the following condition: let G′ be graph induced from these edges, then every con <zx834000> 上传 | 大小:22kb