2016年8月12日
HDU 5807 Keep In Touch DP
摘要： Keep In Touch Problem Description There are n cities numbered with successive integers from 1 to n in Byteland. Also, there are m one-way roads connec 阅读全文
posted @ 2016-08-12 17:38 meekyan 阅读(323) 评论(0) 推荐(0)
Educational Codeforces Round 3 E. Minimum spanning tree for each edge LCA/(树链剖分+数据结构) + MST
摘要： E. Minimum spanning tree for each edge E. Minimum spanning tree for each edge Connected undirected weighted graph without self-loops and multiple edge 阅读全文
posted @ 2016-08-12 15:41 meekyan 阅读(174) 评论(0) 推荐(0)