摘要：
用树状数组求逆序对数。。。#include <cstdio>#include <cstdlib>#include <cmath>#include <cstring>#include <iostream>#define MAX 3000005#define MaxN 10005using namespace std;int ans[MAX];__int64 c[MaxN];inline void updata( int s ){ while( s < MaxN ) { c[s]++; s += ( s & (-s) ); 阅读全文
