题意:给一个图,找图中的最大团,并输出最大团的顶点数。
思路:暴搜。dfs判断每个点在或者不在。加一个剪枝。就是如果剩下的节点+当前已经搜到的最大团的节点<=已经找到的最好结果,就停止搜索。这个剪枝效率蛮低的。 3510ms过的。
http://acm.hdu.edu.cn/showproblem.php?pid=1530
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define rep(i,a,b) for(int i = (a) ; i <= (b) ; i ++)
#define rrep(i,a,b) for(int i = (b) ; i >= (a) ; i --)
#define repS(it,p) for(auto it = p.begin() ; it != p.end() ; it ++)
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)
#define cls(a,x) memset(a,x,sizeof(a))
#define eps 1e-8
using namespace std;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5+5;
const int MAXE = 2e5+5;
typedef long long LL;
typedef unsigned long long ULL;
int T,n,m;
int fx[] = {0,1,-1,0,0};
int fy[] = {0,0,0,-1,1};
int M[55][55];
int best;
int B[55];
int A[55];
bool check(int num,int now) {
rep(i,1,now) {
if(!M[num][A[i]]) return false;
}
return true;
}
void dfs(int num,int x_x,int now) {
if(num == n) {
if(now > best) {
best = now;
rep(i,1,now) B[i] = A[i];
}
return ;
}
if((n-num + now) > best && check(num+1,now)) {
A[++now] = num + 1;
dfs(num+1,1,now);
--now;
}
if((n-num-1 + now) > best) {
dfs(num+1,0,now);
}
}
void input() {
rep(i,1,n) rep(j,1,n) scanf("%d",&M[i][j]);
}
void solve() {
best = 0 ;
dfs(0,0,0);
printf("%d\n",best);
}
int main(void) {
while(scanf("%d",&n),n) {
input();
solve();
}
return 0;
}
网上学到的一个版本 2000ms以下,快了1000+ms。
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define rep(i,a,b) for(int i = (a) ; i <= (b) ; i ++)
#define rrep(i,a,b) for(int i = (b) ; i >= (a) ; i --)
#define repS(it,p) for(auto it = p.begin() ; it != p.end() ; it ++)
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)
#define cls(a,x) memset(a,x,sizeof(a))
#define eps 1e-8
using namespace std;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXE = 2e5+5;
typedef long long LL;
typedef unsigned long long ULL;
const int MAXN = 55;
int T,n,m;
int fx[] = {0,1,-1,0,0};
int fy[] = {0,0,0,-1,1};
int M[MAXN][MAXN];
int dp[MAXN];
int best;
bool dfs(int * id,int top,int cnt) {
if(!top) {
if(best < cnt) {
best = cnt ;
return true;
}
return false;
}
int a[MAXN];
rep(i,1,top) {
if(cnt+top-i+1<=best) return false;
if(cnt+dp[id[i]]<=best) return false;
int lan = 0;
rep(j,i+1,top) if(M[id[i]][id[j]]) a[++lan] = id[j];
if(dfs(a,lan,cnt+1)) return true;
}
return false;
}
int max_clique() {
int id[MAXN];
best = 0;
rrep(i,1,n) {
int top = 0;
rep(j,i+1,n) if(M[i][j]) id[++top] = j;
dfs(id,top,1);
dp[i] = best;
}
return best;
}
void input() {
rep(i,1,n) rep(j,1,n) scanf("%d",&M[i][j]);
}
void solve() {
printf("%d",max_clique());
puts("");
}
int main(void) {
while(scanf("%d",&n),n) {
input();
solve();
}
return 0;
}