随笔分类 -  ACM-图论-floyd

7.18
摘要：题目链接：HDU 5719 Arrange 昨天的B题，昨天做的时候没注意所有谷堆是全排列，看了Clarification才知道，可是不会做。 实际上只需要将自己的代码改动一步就可以了count = count*(c[i]-b[i]-i+2)%mod，也即c[i]-b[i]+1-(i-1) 看这个样 阅读全文
posted @ 2016-07-18 23:24 卷珠帘 阅读(228) 评论(0) 推荐(0)
HDU 1317(Floyd判断连通性+spfa判断正环)
摘要：XYZZY Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4421 Accepted Submission(s): 1252 Problem D 阅读全文
posted @ 2016-07-10 11:30 卷珠帘 阅读(1466) 评论(1) 推荐(0)
一个人的旅行HDU 2066 floyd
摘要：一个人的旅行 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29572 Accepted Submission(s): 10160 Proble 阅读全文
posted @ 2016-05-06 00:38 卷珠帘 阅读(288) 评论(0) 推荐(0)
Shortest Path
摘要：Shortest Path Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1494 Accepted Submission(s): 476 阅读全文
posted @ 2016-04-09 20:56 卷珠帘 阅读(274) 评论(0) 推荐(0)