poj2299 逆序数对，归并排序

#include
using namespace std;
long long int cnt = 0;
void merge_sort(int *A,int left,int right,int *T)
{
if(right-left>1)
{
int mid = left+ (right-left)/2;
int p = left,q = mid,i = left;
merge_sort(A,left,mid,T);
merge_sort(A,mid,right,T);
while(p<mid||q<right)
{
if(q>=right||(p<mid&&A[p]<=A[q]))
T[i++] = A[p++];
else
{
T[i++] = A[q++];
cnt += mid - p;
}
}
for(i = left; i<right; ++i)
A[i] = T[i];
}
}
int main()
{
int n;
while(scanf("%d",&n),n)
{
cnt = 0;
int *A = new int[n];
int *T = new int[n];
for(int i = 0; i<n; ++i)
scanf("%d",&A[i]);
merge_sort(A,0,n,T);
printf("%lld\n",cnt);
}
return 0;
}