乐逍遥xwl

导航

2019年6月3日 #

POJ 3268 （dijkstra算法）

摘要： Silver Cow Party Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at 阅读全文

posted @ 2019-06-03 20:17 乐逍遥xwl 阅读(193) 评论(0) 推荐(0) 编辑

POJ 3264 (线段树）

摘要： Balanced Lineup Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides 阅读全文

posted @ 2019-06-03 19:57 乐逍遥xwl 阅读(147) 评论(0) 推荐(0) 编辑