摘要：
A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. A maximal clique is a clique 阅读全文
摘要：
The "travelling salesman problem" asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shor 阅读全文
摘要：
1.cin和cout消耗的时间比scanf和printf多得多，建议用后者 2.memset不能对数组进行任意初始化，只能初始化为-1，0 3.初始化一般用fill 一维数组：fill (array,array+4,5); vector容器：fill (myvector.begin(),myvect 阅读全文