摘要:
DFS or 随机化dfs: 138K 1738MSView Code #include <stdio.h>#include <string.h>const int MAXN = 25;int best = 0;int map[MAXN][MAXN], n;bool join[MAXN];void dfs(int t, int num){ int i, j ; if(num == 0) { int sum = 0; for(i=1; i<=n; i++) for(j=i+1; j<=n; j++) ... 阅读全文