摘要：
Chinese Postman Problem is a very famous hard problem in graph theory. The problem is to find a shortest closed path or circuit that visits every edge 阅读全文
posted @ 2019-05-09 21:11
black_hole6
阅读(233)
评论(0)
推荐(0)
摘要：
Let’s start with a very classical problem. Given an array a[1…n] of positive numbers, if the value of each element in the array is distinct, how to fi 阅读全文
posted @ 2019-05-09 18:53
black_hole6
阅读(189)
评论(0)
推荐(0)
摘要：
Are you interested in pets? There is a very famous pets shop in the center of the ACM city. There are totally m pets in the shop, numbered from 1 to m 阅读全文
posted @ 2019-05-09 12:24
black_hole6
阅读(333)
评论(0)
推荐(0)
浙公网安备 33010602011771号