题解

#include <bits/stdc++.h>
using namespace std;

int a[105];
int n;

void mergesort(int l, int r){
if(l >= r){
return;
}
int mid = (l + r) / 2;
cout << "[";
for(int i = l; i <= r; i++){
cout << a[i] << " ";
if(i == mid){
cout << "],[";
}
}
cout << "]" << endl;
mergesort(l, mid);
mergesort(mid + 1, r);
}

int main(){
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
mergesort(1, n);
return 0;
}