poj3928 ping pong(水题)

最新推荐文章于 2018-12-27 21:50:00 发布

studying_ysj

最新推荐文章于 2018-12-27 21:50:00 发布

阅读量324

点赞数

分类专栏：树状数组文章标签：树状数组

本文链接：https://blog.csdn.net/studying_ysj/article/details/81261868

版权

这是一篇关于如何利用树状数组高效解决寻找ping pong比赛裁判问题的文章。博主首先介绍了原题背景，然后分别阐述了暴力枚举的算法（时间复杂度过高）和树状数组优化后的算法，其中树状数组用于快速查询和更新。在算法二中，博主解释了如何通过l_up, l_low, r_up, r_low数组来计算裁判的贡献，并处理了相乘可能溢出的情况。文章还探讨了当整数不互异时，原有算法为何会出错，并提出了解决重复计算的方法。" 110971307,10296982,自动输入密码技术在脚本和系统登录中的应用,"['Linux', 'shell脚本', 'Windows', '密码管理', '自动登录']

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

原题传送门

题面

Description
N(3<=N<=20000) ping pong players live along a west-east street(consider the street as a line segment). Each player has a unique skill rank. To improve their skill rank, they often compete with each other. If two players want to compete, they must choose a referee among other ping pong players and hold the game in the referee’s house. For some reason, the contestants can’t choose a referee whose skill rank is higher or lower than both of theirs. The contestants have to walk to the referee’s house, and because they are lazy, they want to make their total walking distance no more than the distance between their houses. Of course all players live in different houses and the position of their houses are all different. If the referee or any of the two contestants is different, we call two games different. Now is the problem: how many different games can be held in this ping pong street?

大致题意:
给定n个互异整数 $a[1]-a[n]$ ,求 ∑ni=1∑<