![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM竞赛
文章平均质量分 84
一生Z彷徨
这个作者很懒,什么都没留下…
展开
-
hdu 5938 Four Operations 贪心
Four Operations Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 69 Accepted Submission(s): 31 Problem Description Little Ruins原创 2016-11-17 19:26:22 · 174 阅读 · 0 评论 -
hdu 5952 Counting Cliques 暴搜+剪枝优化(邻接链表建图,邻接矩阵重建图,另类ac哦)
题目描述: Problem Description A clique is a complete graph, in which there is an edge between every pair of the vertices. Given a graph with N vertices and M edges, your task is to count the number原创 2016-11-17 18:59:41 · 240 阅读 · 0 评论