pat1142 Maximal Clique

题意：输入一个无向图，输入子图问子图是不是团，是不是最大团。

思路：暴力。

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <set>

using namespace std;

const int MAX_N = 210;

int N, M, Q, x, y;
int mp[MAX_N][MAX_N];
set<int> sub;

int main() {
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    scanf("%d %d", &N, &M);
    for (int i = 0; i < M; i++) {
        scanf("%d %d", &x, &y);
        mp[x][y] = mp[y][x] = 1;
    }
    scanf("%d", &Q);
    while (Q--) {
        int k; scanf("%d", &k); sub.clear();
        for (int i = 0; i < k; i++) {
            int t; scanf("%d", &t); sub.insert(t);
        }
        bool isQ = true;
        for (auto it1 = sub.begin(); it1 != sub.end(); it1++) {
            auto tmp = ++it1; it1--;
            for (auto it2 = tmp; it2 != sub.end(); it2++) {
                if (mp[*it1][*it2] == 0) {
                    isQ = false; break;
                }
            }
            if (!isQ) break;
        }
        if (!isQ) {
            printf("Not a Clique\n");
            continue;
        }
        bool isM = true;
        for (int i = 1; i <= N; i++) {
            if (!sub.count(i)) {
                bool flag = true;
                for (auto it = sub.begin(); it != sub.end(); it++) {
                    if (!mp[i][*it]) {
                        flag = false;
                    }
                }
                if (flag) {
                    isM = false; break;
                }
            }
        }
        if (isM) {
            printf("Yes\n");
        } else {
            printf("Not Maximal\n");
        }
    }
    return 0;
}