摘要: //白书 321页 #include #include #include #include #include using namespace std; const int maxn=5003; vectorg[maxn];//g保存原始图 int pre[maxn],lowlink[maxn],sccno[maxn],dfs_clock,scc_cnt; //pre[u]为节点u的搜索次序编号;... 阅读全文
posted @ 2017-01-18 16:52 luckilzy 阅读(245) 评论(0) 推荐(0) 编辑
摘要: The Stable Marriage Problem Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 758 Accepted Submissi 阅读全文
posted @ 2017-01-18 11:50 luckilzy 阅读(346) 评论(0) 推荐(0) 编辑
摘要: Marriage is Stable Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1047 Accepted Submission(s): 5 阅读全文
posted @ 2017-01-18 09:58 luckilzy 阅读(541) 评论(0) 推荐(0) 编辑