摘要: 简单的dfs 但繁琐的可以了 0.0#include#include#includeusing std::sort;int n,m,cnt=0;struct team{ char s[50]; int low,up,d,f;};team a[30];struct match{ in... 阅读全文
posted @ 2013-08-12 21:24 xlc2845 阅读(95) 评论(0) 推荐(0)