摘要:
How many answers wrong "HDOJ 3038" 一个很好的博客:https://www.cnblogs.com/liyinggang/p/5327055.html include include include include include include using nam 阅读全文
摘要:
How many tables "HDOJ 1213" include include include include include include include include using namespace std; const int maxn=1004; int n,m; int set 阅读全文
摘要:
The Suspects "POJ 1611" 这题就是并查集的简单应用 include include include include include include include include using namespace std; const int maxn=30004; int n, 阅读全文
摘要:
Wireless NetWork "POJ 2236" 需要注意这里的树的深度需要初始化为0。 而且,find函数需要使用路径压缩,这里的unint合并函数也使用了优化(用一开始简单的合并过不了)。 include include include include include include us 阅读全文
摘要:
Subway "POJ 2502" 这里除了直接相连的地铁站,其他图上所有的点都要连线,这里是走路的速度。 记住最后的结果需要四舍五入,否则出错。 include include include include include include include include include usin 阅读全文
摘要:
Candies "POJ 3159" 这里是图论的一个应用,也就是差分约束。通过差分约束变换出一个图,再使用Dijikstra算法的链表优化形式而不是vector形式(否则超时)。 阅读全文
摘要:
Invitation Cards "POJ 1511" 从这道题我还是发现了很多的问题,首先就是快速输入输出,这里的ios:: 这一行必须先放在main函数第一行,也就是输入最开始的前面,否则系统疯狂报WA。 其次就是,ios的位置没有错之后又疯狂地报TLE,就是超时了,这个问题要不就是算法的复杂度 阅读全文