HDU - 2838：Cow Sorting

wingrez

于 2018-12-17 11:23:55 发布

阅读量389

点赞数

CC 4.0 BY-SA版权

分类专栏：【记录】算法题解

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.youkuaiyun.com/wingrez/article/details/85046849

【记录】算法题解专栏收录该内容

229 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

本文介绍了HDU 2838 Cow Sorting问题，要求将奶牛按脾气从大到小排序，每次交换相邻两头奶牛的时间代价为它们的脾气之和。给出了解决该问题的思路和参考代码，利用树状数组计算最小总代价。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Cow Sorting

来源：HDU

标签：树状数组

参考资料：

相似题目：

题目

Sherlock’s N (1 ≤ N ≤ 100,000) cows are lined up to be milked in the evening. Each cow has a unique “grumpiness” level in the range 1…100,000. Since grumpy cows are more likely to damage Sherlock’s milking equipment, Sherlock would like to reorder the cows in line so they are lined up in increasing order of grumpiness. During this process, the places of any two cows (necessarily adjacent) can be interchanged. Since grumpy cows are harder to move, it takes Sherlock a total of X + Y units of time to exchange two cows whose grumpiness levels are X and Y.
Please help Sherlock calculate the minimal time req