[NOI题库]4.5算法之动态规划9276:Connected Graph DP

描述
An undirected graph is a set V of vertices and a set of E∈{V*V} edges.An undirected graph is connected if and only if for every pair (u,v) of vertices,u is reachable from v.

You are to write a program that tries to calculate the number of different connected undirected graph with n vertices.
For example,there are 4 different connected undirected graphs with 3 vertices.

题解：

这就是NOIP2017提高组初赛选择题第8题……考场上用排列组合算的，结果这道题就不会做了……答案可以用总情况-不合法情况。令$f[i]$表示$i$个点连通的方案数，$g[i]$表示$i$个点不连通的方案数，然后考虑第一个点所在连通块有多少个点。若有$k$个点，那么剩下的$n-k$个点之间就可以随意连边，这样整个图一定是不连通的，显然，有$n$个点的图，无向边有$C_n^2$条，那么方程就可以推了：

$$g[i]=\sum_{k=1}^{i-1}C_{i-1}^{k-1}\times f[k]\times 2^{C_{n-k}^2}$$ $$f[i]=C_{i}^{2}-g[i]$$
由于要写高精度，所以没有写代码，如有错误很正常，欢迎指出。