olahiuj的博客

想要再努力一点

Fencing the Cows_usaco 5.1_凸包

Description  农夫约翰想要建造一个围栏用来围住他的奶牛,可是他资金匮乏。他建造的围栏必须包括他的奶牛喜欢吃草的所有地点。对于给出的这些地点的坐标,计算最短的能够围住这些点的围栏的长度。Input输入数据的第一行包括一个整数 N。N(0 <= N <= 10,000)表示农夫...

2016-12-01 19:53:21

阅读数:161

评论数:0

森林_ssl1703_dfs+凸包

Description  森林里面有n棵贵重的树,你需要将它们保护起来。保护树木的方法是给它们做一个围栏(专业术语叫“凸包”),但围栏本身需要用这些树来做,因此需要砍下一些树。砍掉哪些树才能让损失的价值最小呢?如果有个解,取被砍掉的树的数目最小的一组。你可以认为在这样的限制下解是唯一的。Input...

2016-09-17 08:31:09

阅读数:177

评论数:0

Wall_poj1113_凸包

DescriptionOnce upon a time there was a greedy King who ordered his chief Architect to build a wall around the King’s castle. The King was so greedy,...

2016-09-16 18:54:10

阅读数:276

评论数:0

Surround The Trees_ssl1720_凸包

Description  There are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So at first he must know the minimal req...

2016-09-05 21:37:30

阅读数:342

评论数:1

提示
确定要删除当前文章?
取消 删除
关闭
关闭