传送门:http://www.lydsy.com/JudgeOnline/problem.php?id=3632
献上nilihan1999神犇的题解http://blog.csdn.net/nilihan1999/article/details/31429079
Code:
#include<bits/stdc++.h>
using namespace std;
const int maxn=55;
int w[maxn][maxn];
int n,ans;
int can[maxn][maxn];
int f[maxn];
bool dfs(int num,int res){
if(!num){
if(res>ans){
ans=res;return 1;
}return 0;
}
for(int i=0;i<num;i++){
if(res+num-i<=ans)return 0;
int u=can[res][i];
if(res+f[u]<=ans)return 0;
int suf=0;
for(int j=i+1;j<num;j++)
if(w[u][can[res][j]])
can[res+1][suf++]=can[res][j];
if(dfs(suf,res+1))return 1;
}return 0;
}
int main(){
scanf("%d",&n);
int u,v;
while(scanf("%d%d",&u,&v)==2)
w[u-1][v-1]=w[v-1][u-1]=1;
for(int i=n-1;i>=0;i--){
int num=0;
for(int j=i+1;j<n;j++)
if(w[i][j])
can[1][num++]=j;
dfs(num,1);
f[i]=ans;
}cout<<ans<<endl;
return 0;
}