洛谷P1908 逆序对(归并排序)
#include <bits/stdc++.h>using namespace std;const int N = 1e8;long long q[N];long long ans = 0;long long tmp[N];void merge_sort(long long q[], int l, int r){ if(l >= r) return; int mid = l + r >> 1; merge_sort(q, l
原创
2021-10-12 14:57:18 ·
217 阅读 ·
0 评论