Maximum Clique |
| Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
| Total Submission(s): 92 Accepted Submission(s): 60 |
|
Problem Description
Given a graph G(V, E), a clique is a sub-graph g(v, e), so that for all vertex pairs v1, v2 in v, there exists an edge (v1, v2) in e. Maximum clique is the clique that has maximum number of vertex.
|
|
Input
Input contains multiple tests. For each test:
The first line has one integer n, the number of vertex. (1 < n <= 50) The following n lines has n 0 or 1 each, indicating whether an edge exists between i (line number) and j (column number). A test with n = 0 signals the end of input. This test should not be processed. |
|
Output
One number for each test, the number of vertex in maximum clique.
|
|
Sample Input
5 |
|
Sample Output
4 |
|
Author
CHENG, Long
|
|
Source
ZOJ Monthly, February 2003
|
|
Recommend
mcqsmall
|
/*
题意：就是给你一个图，然后输出最大团嘛
*/
#include<bits/stdc++.h>
using namespace std; /***********************************最大团模板************************************/
struct MAX_CLIQUE {
static const int N=; bool G[N][N];
int n, Max[N], Alt[N][N], ans; bool DFS(int cur, int tot) {
if(cur==) {
if(tot>ans) {
ans=tot;
return ;
}
return ;
}
for(int i=; i<cur; i++) {
if(cur-i+tot<=ans) return ;
int u=Alt[tot][i];
if(Max[u]+tot<=ans) return ;
int nxt=;
for(int j=i+; j<cur; j++)
if(G[u][Alt[tot][j]]) Alt[tot+][nxt++]=Alt[tot][j];
if(DFS(nxt, tot+)) return ;
}
return ;
} int MaxClique() {
ans=, memset(Max, , sizeof Max);
for(int i=n-; i>=; i--) {
int cur=;
for(int j=i+; j<n; j++) if(G[i][j]) Alt[][cur++]=j;
DFS(cur, );
Max[i]=ans;
}
return ans;
}
}; MAX_CLIQUE fuck;
/***********************************最大团模板************************************/
int n;
int main(){
// freopen("in.txt","r",stdin);
while(scanf("%d",&fuck.n)!=EOF&&fuck.n){
for(int i=;i<fuck.n;i++){
for(int j=;j<fuck.n;j++){
scanf("%d",&fuck.G[i][j]);
}
}
printf("%d\n",fuck.MaxClique());
}
return ;
}