POJ 2299 Ultra-QuickSort

原创 2015年11月21日 19:52:04
Ultra-QuickSort
Time Limit: 7000MS   Memory Limit: 65536K
Total Submissions: 50447   Accepted: 18499

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

Source


思路:直接写一个归并排序求逆序数的模板就行了,不过这里要注意,使用int会溢出

ac代码

#include <iostream>
using namespace std;

const int maxn=500000+5;
long long  ans=0;
long long  a[maxn],t[maxn];
void mergesort(int x,int y){

    if(x==y) return ;

    else {
        int mid=(x+y)/2;

        int mm=mid+1,xx=x,i=x;
        mergesort(x,mid);
        mergesort(mid+1,y);

        while(xx<=mid && mm<=y){

            if(a[xx]<=a[mm]) t[i++]=a[xx++];
            else {
                ans+=mid-xx+1;
                t[i++]=a[mm++];
            }
        }

        while(xx<=mid) t[i++]=a[xx++];
        while(mm<=y)  t[i++]=a[mm++];

         for(int i=x;i<=y;i++){
            a[i]=t[i];
        }
    }

}
int  main(){

    int n;
    while(cin>>n &&n){

        for(int i=0;i<n;i++){
            cin>>a[i];
        }
        ans=0;
        mergesort(0,n-1);
        cout<<ans<<endl;
    }
    return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

POJ2299-Ultra-QuickSort

  • 2011年07月31日 00:11
  • 12KB
  • 下载

POJ 2299 Ultra-QuickSort(离散化+树状数组求逆序对)

Ultra-QuickSort Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 54900   Accepted:...

poj2299 Ultra-QuickSort(离散化+树状数组求逆序数)

Description In this problem, you have to analyze a particular sorting algorithm. The algorithm proce...

poj 2299 Ultra-QuickSort【归并排序基础应用】

Ultra-QuickSort Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 48706 ...
  • wyjwyl
  • wyjwyl
  • 2015年08月13日 21:06
  • 225

POJ2299 Ultra-QuickSort

题目链接:http://poj.org/problem?id=2299 题目大意:通过交换相邻两个的序列元素,使得序列为升序,问你最小需要多少次。 解题思路:实质就要你求该序列的逆序数。求...

逆序数poj 2299 Ultra-QuickSort sgu 180 Inversions

poj 2299

POJ2299 Ultra-QuickSort 【树状数组】+【hash】

Ultra-QuickSort Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 39529 ...

poj 2299 Ultra-QuickSort (归并求逆序数)

Ultra-QuickSort Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 54525   Accepted:...

[POJ]2299 Ultra-QuickSort

[POJ]2299 Ultra-QuickSort问题 Description In this problem, you have to analyze a particula...

poj 2299 Ultra-QuickSort

Description In this problem, you have to analyze a particular sorting algorithm. The algorithm pr...
  • joan333
  • joan333
  • 2011年08月06日 13:08
  • 117
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 2299 Ultra-QuickSort
举报原因:
原因补充:

(最多只允许输入30个字)