1142 Maximal Clique (25分)

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 that cannot be extended by including one more adjacent vertex. (Quoted from https://en.wikipedia.org/wiki/Clique_(graph_theory))
Now it is your job to judge if a given subset of vertices can form a maximal clique.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers Nv (≤ 200), the number of vertices in the graph, and Ne, the number of undirected edges. Then Ne lines follow, each gives a pair of vertices of an edge. The vertices are numbered from 1 to Nv.
After the graph, there is another positive integer M (≤ 100). Then M lines of query follow, each first gives a positive number K (≤ Nv), then followed by a sequence of K distinct vertices. All the numbers in a line are separated by a space.

Output Specification:

For each of the M queries, print in a line Yes if the given subset of vertices can form a maximal clique; or if it is a clique but not a maximal clique, print Not Maximal; or if it is not a clique at all, print Not a Clique.

先判断给出的序列中是否两两之间有边，再判断是否存在不在序列中的顶点，使得该顶点与序列中的所有顶点之间都有边。

#include<iostream>
using namespace std;
const int maxn = 210;
int graph[maxn][maxn];
int ne, nv, m;
int main() {
	cin >> nv >> ne;
	for (int i = 1; i <= nv; i++)
		for (int j = 1; j <= nv; j++)graph[i][j] = 0;
	for (int i = 0; i < ne; i++) {
		int x, y;
		cin >> x >> y;
		graph[x][y] = graph[y][x] = 1;
	}
	cin >> m;
	for (int i = 0; i < m; i++) {
		int k, mark[maxn] = { 0 }, nodes[maxn], isCli = 1, isMax = 1;
		cin >> k;
		for (int j = 0; j < k; j++) {
			cin >> nodes[j];//顶点号
			mark[nodes[j]] = 1;//用于标记在序列中的顶点
		}
		for (int j = 0; j < k; j++) {//判断是否为clique
			for (int l = j+1; l < k; l++) {
				if (graph[nodes[j]][nodes[l]] == 0) {
					isCli = 0; 
					break;
				}
			}
		}
		for (int j = 1; j <= nv; j++) {//判断是否为max clique
			int notMax = 1;
			if (mark[j] == 0) {
				for (int l = 0; l < k; l++) {
					if (graph[j][nodes[l]] == 0) {
						notMax = 0;
						break;
					}
				}
				if (notMax == 1)isMax = 0;
			}
		}
		if (!isCli)cout << "Not a Clique" << endl;
		else if (!isMax)cout << "Not Maximal" << endl;
		else
			cout << "Yes" << endl;
	}
	return 0;
}

我还以为会超时呢