POJ1990 MooFest 树状数组题解(附图)

最新推荐文章于 2020-05-13 11:19:40 发布

bestsort

最新推荐文章于 2020-05-13 11:19:40 发布

阅读量774

点赞数

分类专栏：数据结构树上乱搞文章标签： POJ1990 树状数组 POJ 数据结构

本文链接：https://blog.csdn.net/bestsort/article/details/80853221

版权

这篇博客介绍了POJ1990题目的解决方案，涉及MooFest活动中，拥有不同听力阈值的奶牛在一条直线上交谈时所需最小声音的计算。通过排序听力阈值，利用树状数组和容斥原理，求出所有奶牛对话产生的声音总和。

摘要由CSDN通过智能技术生成

MooFest

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions:9207		Accepted: 4167

Description

Every year, Farmer John's N (1 <= N <= 20,000) cows attend "MooFest",a social gathering of cows from around the world. MooFest involves a variety of events including haybale stacking, fence jumping, pin the tail on the farmer, and of course, mooing. When the cows all stand in line for a particular event, they moo so loudly that the roar is practically deafening. After participating in this event year after year, some of the cows have in fact lost a bit of their hearing.

Each cow i has an associated "hearing" threshold v(i) (in the range 1..20,000). If a cow moos to cow i, she must use a volume of at least v(i) times the distance between the tw