POJ1804 Brainman【逆序偶+归并排序】

Brainman

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 12463		Accepted: 6288

Description

Background 
Raymond Babbitt drives his brother Charlie mad. Recently Raymond counted 246 toothpicks spilled all over the floor in an instant just by glancing at them. And he can even count Poker cards. Charlie would love to be able to do cool things like that, too. He wants to beat his brother in a similar task. 

Problem 
Here's what Charlie thinks of. Imagine you get a sequence of N numbers. The goal is to move the numbers around so that at the end the sequence is ordered. The only operation allowed is to swap two adjacent numbers. Let us try an example: 

Start with: 2 8 0 3 
swap (2 8) 8 2 0 3 
swap (2 0) 8 0 2 3 
swap (2 3) 8 0 3 2 
swap (8 0) 0 8 3 2 
swap (8 3) 0 3 8 2 
swap (8 2) 0 3 2 8 
swap (3 2) 0 2 3 8 
swap (3 8) 0 2 8 3 
swap (8 3) 0 2 3 8

So the sequence (2 8 0 3) can be sorted with nine swaps of adjacent numbers. However, it is even possible to sort it with three such swaps: 

Start with: 2 8 0 3 
swap (8 0) 2 0 8 3 
swap (2 0) 0 2 8 3 
swap (8 3) 0 2 3 8

The question is: What is the minimum number of swaps of adjacent numbers to sort a given sequence?Since Charlie does not have Raymond's mental capabilities, he decides to cheat. Here is where you come into play. He asks you to write a computer program for him that answers the question. Rest assured he will pay a very good prize for it.

Input

The first line contains the number of scenarios. 
For every scenario, you are given a line containing first the length N (1 <= N <= 1000) of the sequence,followed by the N elements of the sequence (each element is an integer in [-1000000, 1000000]). All numbers in this line are separated by single blanks.

Output

Start the output for every scenario with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the minimal number of swaps of adjacent numbers that are necessary to sort the given sequence. Terminate the output for the scenario with a blank line.

Sample Input

4
4 2 8 0 3
10 0 1 2 3 4 5 6 7 8 9
6 -42 23 6 28 -100 65537
5 0 0 0 0 0

Sample Output

Scenario #1:
3

Scenario #2:
0

Scenario #3:
5

Scenario #4:
0

Source

TUD Programming Contest 2003, Darmstadt, Germany

 

问题链接：POJ1804 Brainman

问题简述：（略）

问题分析：

  可以定义逆序对，一个序列中存在a[i]>a[j]且i<j，则a[i]与a[j]构成一对逆序对。

  一个序列的逆序对的总数，就是这个序列的逆序数。

  相邻元素进行交换，那么每次交换序列逆序数必然改变1，而一个递增的序列逆序数为0。因此，最少交换次数即为逆序数，而每次按照逆序对减少的方式交换就得到递增序列。

  这个程序必须采用基于分治法的排序算法程序，以便保证时间复杂度为O(nlogn)。

程序说明：

  使用暴力程序则容易出现TLE。采用分治法，使用归并排序的思想来实现，计算复杂度降低。

  程序使用标准的归并排序程序修改而成，只是增加了第19行。

  这次写的程序，把16行改为<=（原先是<）。这个是必要的，如果数的序列中出现相同值，这里是需要改的。

题记：（略）

参考链接：归并排序（分治法）

 

AC的C语言程序如下：

/* POJ1804 Brainman */

#include <iostream>
#include <stdio.h>

using namespace std;

const int N = 1000;
int a[N], temp[N], cnt;

void merge(int low, int mid, int high)
{
    int i = low, j=mid+1, k = low;
    while(i <= mid && j <= high)
    {
        if(a[i] <= a[j])
            temp[k++] = a[i++];
        else {
            cnt += j - k;
            temp[k++] = a[j++];
        }
    }
    while(i <= mid)
        temp[k++] = a[i++];
    while(j <= high)
        temp[k++] = a[j++];
    for(i=low; i<=high; i++)
         a[i] = temp[i];
}

void mergesort(int low, int high)
{
    if(low < high)
    {
        int middle = (low + high) / 2;
        mergesort(low, middle);
        mergesort(middle+1, high);
        merge(low, middle, high);
    }
}

int main()
{
    int t, caseno = 0, n;
    scanf("%d", &t);
    while(t--) {
        scanf("%d", &n);
        for(int i = 0; i < n; i++)
            scanf("%d", &a[i]);

        cnt = 0;
        mergesort(0, n - 1);

        printf("Scenario #%d:\n%d\n\n", ++caseno, cnt);
    }

    return 0;
}