#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include <stdio.h>
using namespace std;
const int MAXN = 1000+10;
int temp[MAXN];
int arr[MAXN];
int number;//逆序数个数
//整合
void Combine(int left,int middle,int right){
int i = left;
int j = middle + 1;
int k = left;
while(i <= middle && j <= right){
if(arr[i] <= arr[j]){
temp[k++] = arr[i++];
}else {
number += middle +1-i;//添加这一行代码计算逆序数
temp[k++] = arr[j++];
}
}
while(i <= middle){
temp[k++] = arr[i++];
}
while(j <= right){
temp[k++] = arr[j++];
}
for( k = left ; k <= right ;k++){
arr[k] = temp[k];
}
}
//拆分
void MergeSort(int left,int right){
if(left < right ){
int middle = left + (right - left) /2;
MergeSort(left,middle);
MergeSort(middle+1,right);
Combine(left,middle,right);
}
}
int main(){
int caseNumber;
scanf("%d",&caseNumber);
for (int caseOrder = 1; caseOrder <= caseNumber; ++caseOrder){
int n;
scanf("%d",&n);
for(int i = 0;i<n;i++){
scanf("%d",&arr[i]);
}
number = 0;//初始化逆序数个数
MergeSort(0,n-1);
printf("Scenario #%d:\n",caseOrder);
printf("%d\n\n",number);
}
return 0;
}
北大oj1804
最新推荐文章于 2023-10-17 21:25:48 发布