POJ2299

最新推荐文章于 2020-02-01 23:36:11 发布

LeeBooL

最新推荐文章于 2020-02-01 23:36:11 发布

阅读量322

点赞数

分类专栏：排序 POJ

本文链接：https://blog.csdn.net/u013570474/article/details/38105307

版权

POJ 同时被 2 个专栏收录

93 篇文章 0 订阅

订阅专栏

排序

2 篇文章 0 订阅

订阅专栏

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

using namespace std;
long long int res;
long long int num[500000 + 5];
long long int ans[500000 + 5];

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

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

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

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

}


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

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

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


}


int main()
{
    long long int n;
    while(scanf("%I64d",&n)!=EOF,n)
    {
        res = 0;
        for( int i = 0; i<n; i++)
         scanf("%lld",&num[i]);
        memset(ans,0,sizeof(ans));
        memerysort(num,0,n-1,ans);
        printf("%lld\n",res);
    }
    return 0;
}