其他oj
lzr010506
OI党
展开
-
计算几何 usaco Fencing the Cows 圈奶牛
Description 农夫约翰想要建造一个围栏用来围住他的奶牛,可是他资金匮乏。他建造的围栏必须包括他的奶牛喜欢吃草的所有地点。对于给出的这些地点的坐标,计算最短的能够围住这些点的围栏的长度。 Input 输入数据的第一行包括一个整数 N。N(0 )表示农夫约翰想要围住的放牧点的数目。接下来N 行,每行由两个实数组成,Xi 和 Yi,对应平面上的放牧点坐标(-1,000,000原创 2016-03-01 20:14:28 · 841 阅读 · 0 评论 -
SPOJ375 Query on a tree
Description You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3…N-1.We will ask you to perfrom some instructions of the following form:CHANGE i ti : c原创 2016-05-16 11:27:34 · 416 阅读 · 0 评论 -
SPOJ PT07J Query on a tree II
You are given a tree (an undirected acyclic connected graph) with N nodes, and edges numbered 1, 2, 3…N-1. Each edge has an integer value assigned to it, representing its length.We will ask you to perf原创 2016-05-17 18:01:50 · 600 阅读 · 0 评论