- 博客(2)
- 收藏
- 关注
RSS订阅原创 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
原创 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
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人