J Tourism Planning
摘要：
网络流、貌似很多人状态ＤＰ >_<最大权闭合子图 The 36th ACM/ICPC Asia Regional Beijing Site Online Contesthttp://acm.bupt.edu.cn/onlinejudge/newoj/showProblem/show_problem.php?problem_id=220int ins[100];int val[50][50], comp[50][50];int main(){ int n, m; while(scanf("%d %d", &n, &m) && (n| 阅读全文