DFS解决任意组合原来这样简单
摘要:
HDU 2660http://acm.hdu.edu.cn/showproblem.php?pid=2660题意就不说了,直接走代码。View Code #include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>using namespace std;#define max(a, b) (a>b?a:b)int V[21], W[21], Ans, N, K, L, i;void DFS(int p, int vv, 阅读全文
posted @ 2012-03-28 18:45 More study needed. 阅读(203) 评论(0) 推荐(0) 编辑