HDU 2689

最新推荐文章于 2020-06-14 12:16:48 发布

bupt_zbybr

最新推荐文章于 2020-06-14 12:16:48 发布

阅读量582

点赞数

分类专栏： ACM-数据结构文章标签： ACM-数据结构

本文链接：https://blog.csdn.net/u014598631/article/details/28199691

版权

ACM-数据结构专栏收录该内容

3 篇文章 0 订阅

订阅专栏

HDU 2689

Sort it

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2244 Accepted Submission(s): 1612

Problem Description

You want to processe a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. Then how many times it need.
For example, 1 2 3 5 4, we only need one operation : swap 5 and 4.

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 <= 1000); the next line contains a permutation of the n integers from 1 to n.

Output

For each case, output the minimum times need to sort it in ascending order on a single line.

Sample Input

Sample Output

0
6

Author

WhereIsHeroFrom

Source

ZJFC 2009-3 Programming Contest

http://acm.hdu.edu.cn/showproblem.php?pid=2689

这是一道简单的树状数组求逆序数的应用，给定n和1~n的一个排列，每次能交换相邻的两个数，问要操作多少次才能变成1~n的递增序列。这道题因为给定的是1~n的排列，所以不需要离散化数据。

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<ctype.h>
#include<algorithm>
using namespace std;
#pragma comment(linker,"/STACK:102400000,102400000")
#define pi acos(-1.0)
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
typedef long long LL;
int a[1005],n;

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

void update(int x,int c)
{
    while(x<=n)
    {
        a[x]+=c;
        x+=lowbit(x);
    }
}

int sum(int x)
{
    int res=0;
    while(x>0)
    {
        res+=a[x];
        x-=lowbit(x);
    }
    return res;
}

int main(void)
{
	int i,x,ans;
	while(scanf("%d",&n)!=EOF)
	{
		memset(a,0,sizeof(a));
		ans=0;
		for(i=1;i<=n;i++)
		{
			scanf("%d",&x);
			update(x,1);
			ans+=sum(n)-sum(x);
		}
		printf("%d\n",ans);
	}
	return 0;
}