#Graveyard

POJ 3154 Graveyard【多解,数论,贪心】

TimeLimit:2000MS MemoryLimit:65536KTotalSubmissions:1707 Accepted:860 SpecialJudgeDescriptionProgrammingcontestsbecamesopopularintheyear2397thatt...

UVAlive 3708 Graveyard(最优化问题)

题目描述:   在周长10000的圆上,初始等距的放置着n个雕塑,现在新加入m个雕塑,要使得这n+m个雕塑仍然等距,问原来n个雕塑要移动的距离总和的最小值.原题地址:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=15...