poj 2299 Ultra-QuickSort 线段树求逆序数+离散化||归并排序求逆序数

题意：

求数列逆序数

思路：

线段树或树状数组思路：数据较大，但数据量较小，故先离散化，再做线段树或树状数组单点更新。

什么是归并排序?：点击打开链接

离散化同poj 2528点击打开链接。求逆序数同 poj 2352点击打开链接。

线段树代码：

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <algorithm>
#define ls rt<<1,l,mid
#define rs (rt<<1)+1,mid+1,r
using namespace std;

int st;int en;
const int MAXN=500050;
long long tree[5*MAXN];


void update(int rt,int l,int r){
    tree[rt]++;
    if(l==r) return ;
    int mid=(r+l)>>1;
    if(en<=mid)
        update(ls);
    else
        update(rs);
    return ;
}
long long query(int rt,int l,int r){
    if(st<=l&&r<=en)
        return tree[rt];
    int mid=(l+r)>>1;
    long long ans=0;
    if(st<=mid)
        ans+=query(ls);
    if(mid<en)
        ans+=query(rs);
    return ans;
}
typedef struct Node{
    int x;int y;
    bool operator < (const Node &a)const{
        return a.x>x;
    }
}Node;
int a[MAXN];
Node b[MAXN];

int main(){
    int n;
    while(~scanf("%d",&n)&&n){
        memset(tree,0,sizeof(tree));
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        //map <int,int> flag;
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            b[i].x=a[i];
            b[i].y=i;
        }
        sort(b,b+n);
        long long ans=0;
        for(int i=0;i<n;i++)
            a[b[i].y]=i+1;
        for(int i=0;i<n;i++){
            st=1;en=a[i];
            ans+=i-query(1,1,n);//query出来的是小于a[i]的数的个数，反之i-a[i]就是大于的个数
            en=a[i];
            update(1,1,n);
        }
        printf("%lld\n",ans);
    }
    return 0;
<span style="font-size:18px;">}</span>

树状数组代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN=500000+10;
typedef struct Node{
    int x;int y;
    bool operator <(const Node &a)const{
        return a.x<x;
    }
}Node;
Node a[MAXN];
int b[MAXN];
int n;
bool cmp(Node a,Node b){
    return a.y<b.y;
}
void ini(){
    memset(b,0,sizeof(b));
    for(int i=0;i<n;i++){
        scanf("%d",&a[i].x);
        a[i].y=i;
    }
}
void lisan(){
    sort(a,a+n);
    for(int i=0;i<n;i++)
        a[i].x=i+1;
    sort(a,a+n,cmp);
}
int lowbit(int x){
    return x&(-x);
}
void modify(int x,int add){
    while(x<=MAXN){
        b[x]+=add;
        x+=lowbit(x);
    }
}
int get_sum(int x){
    int ret=0;
    while(x!=0){
        ret+=b[x];
        x-=lowbit(x);
    }
    return ret;
}
long long solve(){
    long long ans=0;
    for(int i=0;i<n;i++){
        ans+=get_sum(a[i].x);
        modify(a[i].x,1);
    }
    return ans;
}
int main()
{
    while(cin>>n&&n){
        ini();
        lisan();
        cout<<solve()<<endl;
    }
}

归并排序代码：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=500100;
int a[MAXN];
long long ans;
void mege(int l,int r){
    if(l==r)  return ;
    int mid=(l+r)>>1;
    mege(l,mid);
    mege(mid+1,r);
    int i=l;int j=mid+1;
    while(i<=mid&&j<=r){
        if(a[i]>a[j]){
            ans+=mid-i+1;
            j++;
        }else
            i++;
    }
    sort(a+l,a+r+1);
    return ;
}
int main(){
    int n;
    while(~scanf("%d",&n)&&n){
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        ans=0;
        mege(1,n);
        printf("%lld\n",ans);
    }
}

Description

In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. For the input sequence 
9 1 0 5 4 ,
Ultra-QuickSort produces the output 
0 1 4 5 9 .
Your task is to determine how many swap operations Ultra-QuickSort needs to perform in order to sort a given input sequence.

Input

The input contains several test cases. Every test case begins with a line that contains a single integer n < 500,000 -- the length of the input sequence. Each of the the following n lines contains a single integer 0 ≤ a[i] ≤ 999,999,999, the i-th input sequence element. Input is terminated by a sequence of length n = 0. This sequence must not be processed.

Output

For every input sequence, your program prints a single line containing an integer number op, the minimum number of swap operations necessary to sort the given input sequence.

Sample Input

5
9
1
0
5
4
3
1
2
3
0

Sample Output

6
0