UVA 299 - Train Swapping

题目大意：求给定个数中的逆序对的个数

思路：这题用两个for的暴力就可以过了，时间复杂度是n平方的。也可以用分治法，时间复杂度是nlogn。

总结：水题，刚开始直接两个 for就过了，后来在网上查了下有没有时间复杂度低点的求逆序对的方法，发现可以用分治法，就是稍微改写了下归并排序，时间只有nlogn，将这题又重新敲了一遍。题是道水题，不过学会了分治法求逆序对，还是个不错的收获。

暴力代码：

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int str[60];

int main()
{
    int t = 0;
    scanf("%d", &t);
    while (t--)
    {
        int n, num = 0;
        scanf("%d", &n);
        memset(str, 0 , sizeof(str));
        for (int i = 0; i < n; i++)
            scanf("%d", &str[i]);
        for (int i = 0; i < n; i++)
        {
            for (int j = i + 1; j < n; j++)
            {
                if (str[i] > str[j])
                    num++;
            }
        }
        printf("Optimal train swapping takes %d swaps.\n", num);
    }
    return 0;
}

分治法代码：

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int str[100];
int l[100];
int r[100];
int count = 0;

void Merge(int left, int mid, int right)
{
    int n1 = mid - left + 1;
    int n2 = right - mid;
    for (int i = 1; i <= n1; i++)
        l[i] = str[left+i-1];
    for (int i = 1; i <= n2; i++)
        r[i] = str[mid+i];
    int i = 1, j = 1;
    l[n1+1] = 2000000000;
    r[n2+1] = 2000000000;
    for (int k = left; k <= right; k++)
    {
        if (l[i] <= r[j])
        {
            str[k] = l[i];
            i++;
        }
        else
        {
            str[k] = r[j];
            j++;
            count += n1 - i + 1;
        }
    }
}

void Mergesort(int left, int right)
{
    int mid;
    if (left < right)
    {
        mid = (left + right) / 2;
        Mergesort(left, mid);
        Mergesort(mid+1, right);
        Merge(left, mid, right);
    }
}

int main()
{
    //freopen("e:\\input.txt", "r", stdin);
    int t;
    scanf("%d", &t);
    while (t--)
    {
        int n;
        scanf("%d", &n);
        memset(str, 0, sizeof(str));
        count = 0;
        for (int i = 1; i <= n; i++)
            scanf("%d", &str[i]);
        Mergesort(1, n);
        printf("Optimal train swapping takes %d swaps.\n", count);
    }
    return 0;
}