﻿ HDU 1394 Minimum Inversion Number (树状数组求逆序 - 公司荣誉 - 武汉味美食家餐饮管理有限公司

# HDU 1394 Minimum Inversion Number (树状数组求逆序

HDU 1394 Minimum Inversion Number (树状数组求逆序数)

Minimum Inversion Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13942 Accepted Submission(s): 8514
Problem Description The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.

For a given sequence of numbers a1, a2, ..., an, if we move the first m >= 0 numbers to the end of the seqence, we will obtain another sequence. There are totally n such sequences as the following:

a1, a2, ..., an-1, an (where m = 0 - the initial seqence)

a2, a3, ..., an, a1 (where m = 1)

a3, a4, ..., an, a1, a2 (where m = 2)

...

an, a1, a2, ..., an-1 (where m = n-1)

You are asked to write a program to find the minimum inversion number out of the above sequences.

Input The input consists of a number of test cases. Each case consists of two lines: the first line contains a positive integer n (n <= 5000); the next line contains a permutation of the n integers from 0 to n-1.

Output For each case, output the minimum inversion number on a single line.

Sample Input

10
1 3 6 9 0 8 5 7 4 2
Sample Output

16
Author CHEN, Gaoli Source ZOJ Monthly, January 2003

#include
#include
#include
using namespace std;
int const MAX = 5005;
int c[MAX], a[MAX], n;

int lowbit(int x)
{
return x & (-x);
}

{
for(int i = x; i <= n; i += lowbit(i))
c[i] ++;
}

int Sum(int x)
{
int res = 0;
for(int i = x; i > 0; i -= lowbit(i))
res += c[i];
return res;
}

int main()
{
while(scanf(%d, &n) != EOF)
{
memset(c, 0, sizeof(c));
int ini = 0;
for(int i = 1; i <= n; i++)
{
scanf(%d, &a[i]);
a[i] ++;
ini += Sum(n) - Sum(a[i]);
}
int mi = ini;
for(int i = 1; i <= n; i++)
{
ini += (-(a[i] - 1) + n - (a[i] - 1) - 1);
mi = min(mi, ini);
}
printf(%d
, mi);
}
}

• 上一篇：如何设计一个可用的web容器
• 下一篇：最后一页
• 人气故事
 台湾43死空难调查：坠河前8秒机师才... 07-06 探秘“女神”综艺首秀 林青霞主要负... 07-28 两所小学进行拔河比赛 接连有2名学... 01-11 探讨PHP页面跳转几种实现技巧 09-07 陕西退休干部轻信“买药中百万大奖”... 08-02 日本上演超大南瓜比拼 千余斤巨型瓜... 10-06 苏宁孙为民：现在打京东 不能说我们... 11-03 第二十二届兰洽会聚焦“一带一路”主... 01-01 曾炜：“禁摩限电”史上最严，为何民... 06-30 南京虐童案被告：宝宝很不听话 打孩... 10-08 房价低萌妹多 中国买房娶媳妇|唐老... 11-06 广西旅游投诉热线7月1日开通 号码全... 07-07 西藏成立藏文古籍修复中心抢救藏文文... 07-27 中超-鲁能2-2压哨扳平恒大|网游之我... 11-26 别让没路标扫了乡村游的兴(三农微观察) 05-17 党内竞选无对手 安倍连任自民党总裁... 09-28 卡汀财经分享—考证已是折磨，那些非... 02-22 有助大脑发育 婴幼儿智能可穿戴设备... 10-27 发改委 今年企业债不能违约 更多新... 07-20 上半年浙江省环境行政处罚案件4154件... 08-10
﻿