图论有个经典问题是这样的:给定一个无向图,把图中的结点染成尽量少的颜色,使得相邻结点颜色不同.
用d(s)表示把结点集s染色,所需的颜色数的最小值,则
d(s) = d(s-s’) +1;其中s’是s的一个子集,并且内部没有边,即s’中任意两点不想邻.
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include <iostream>
using namespace std;
#define INF 1e5
#define maxn 20
int Graph[maxn][maxn];
int dp[1<<maxn], n, m;
bool no_edge_inside(int s)
{
vector<int> v;
for(int i = 0; i < n; i++)
{
if(s & (1<<i))
v.push_back(i);
}
for(int i = 0; i < v.size(); i++)
{
for(int j = i+1; j < v.size(); j++)
if(Graph[v[i]][v[j]])
return false;
}
return true;
}
int main()
{
// freopen("in.txt", "r", stdin);
cin >> n >> m;
memset(Graph, 0, sizeof(Graph));
for(int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
Graph[a][b] = Graph[b][a] = 1;
}
dp[0] = 0;
for(int s = 1; s < (1<<n); s++)
{
dp[s] = INF;
for(int j = s; j; j = (j-1)&s)
{
if(no_edge_inside(j))
dp[s] = min(dp[s], dp[s-j] + 1);
}
}
cout << dp[(1<<n)-1] << endl;
}