POJ1804

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

using namespace std;
int num[1000 + 10];
int ans[1000 + 10];
int res = 0;

void memeryarray( int a[], int first, int last, int mid, int ans[])
{
    int m = mid;
    int i = first;
    int j = mid + 1;
    int k = 0;

    while( i <= m && j <= last)
    {
        if(a[i] <= a[j])
           ans[k++] = a[i++];
        else
        {
            ans[k++] = a[j++];
            res += m - i + 1;
        }
    }

    while(i <= m)
      ans[k++] = a[i++];
    while(j <= last)
      ans[k++] = a[j++];

    for( int l = 0 ; l<k ;l++)
      a[first + l] = ans[l];
}

void memerysort( int a[], int first, int last, int ans[])
{
    if(first < last)
    {
         int mid = (first + last) /2;

         memerysort( a, first, mid, ans);
         memerysort( a, mid + 1, last, ans);

         memeryarray(a, first, last, mid , ans);
    }

}
int main()
{
    int n,t;
    scanf("%d",&t);
    for( int i =1; i<=t; i++)
    {
        printf("Scenario #%d:\n",i);

        scanf("%d",&n);
        memset(ans,0,sizeof(ans));
        res = 0;

        for( int j = 0; j<n; j++)
         scanf("%d",&num[j]);

        memerysort(num, 0, n-1, ans);
      printf("%d\n\n",res);
    }
}