提交时间:2024-03-18 14:01:36
运行 ID: 138757
# include <bits/stdc++.h> using namespace std ; struct mch { int h , id ; } a [114514] , b [114514] ; void mrg ( int l , int r ) { if ( l >= r ) { return ; } int mid = l + r ; mid /= 2 ; mrg ( l , mid ) ; mrg ( mid + 1 , r ) ; int i = l , j = mid + 1 , k = l ; while ( i <= mid && j <= r ) { if ( a [i] > a [j] ) { tmp [k ++] = a [j ++] ; ans = ans + mid - i + 1 ; ans %= 99999997 ; } else { tmp [k ++] = a [i ++] ; } } while ( i <= mid ) { tmp [k ++] = a [i ++] ; } return ; } int main ( ) { return 0 ; }