2015年10月23日
find the most comfortable road（并差集，找差值最小的权值）
摘要： find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5359Accepted Submiss... 阅读全文
posted @ 2015-10-23 21:06 handsomecui 阅读(620) 评论(0) 推荐(0)
Network of Schools(强连通分量+缩点） （问添加几个点最少点是所有点连接+添加最少边使图强连通)
摘要： Network of SchoolsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 13801Accepted: 5505DescriptionA number of schools are connected to a comput... 阅读全文
posted @ 2015-10-23 20:01 handsomecui 阅读(393) 评论(0) 推荐(0)
Happy Matt Friends(dp)
摘要： Happy Matt FriendsTime Limit: 6000/6000 MS (Java/Others)Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 1810Accepted Submission(s): 71... 阅读全文
posted @ 2015-10-23 17:56 handsomecui 阅读(427) 评论(0) 推荐(1)
D - 金樽清酒斗十千(搜索dfs)
摘要： D - 金樽清酒斗十千 Time Limit:2000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 589JDescriptionMasha has recently b... 阅读全文
posted @ 2015-10-23 13:57 handsomecui 阅读(479) 评论(0) 推荐(0)