标签:
一开始直接 O( n² ) 暴力..结果就 A 了... USACO 数据是有多弱 = =
先sort , 然后自己再YY一下就能想出来...具体看code
-----------------------------------------------------------------------------------------
-----------------------------------------------------------------------------------------
Farmer John has received a noise complaint from his neighbor, Farmer Bob, stating that his cows are making too much noise. FJ‘s N cows (1 <= N <= 10,000) all graze at various locations on a long one-dimensional pasture. The cows are very chatty animals. Every pair of cows simultaneously carries on a conversation (so every cow is simultaneously MOOing at all of the N-1 other cows). When cow i MOOs at cow j, the volume of this MOO must be equal to the distance between i and j, in order for j to be able to hear the MOO at all. Please help FJ compute the total volume of sound being generated by all N*(N-1) simultaneous MOOing sessions.
* Line 1: N * Lines 2..N+1: The location of each cow (in the range 0..1,000,000,000).
* Line 1: A single integer, the total volume of all the MOOs.
BZOJ 1679: [Usaco2005 Jan]Moo Volume 牛的呼声( )
标签:
原文地址:http://www.cnblogs.com/JSZX11556/p/4561792.html