题目链接
我们可以移动首点放到队尾上去,问的是这样的N种组合种,逆序对数量最小的那一对。
我们可以利用线段树O(N*log(N))的求出初始时候的逆序对的个数,每次往后塞进去一个,将头放到尾上去,然后呢,会发现,我们把头放到尾,少掉的对逆序对的贡献是a[i] - x(a[i]个比它小的点),多出来的对逆序对的贡献是N - 1 - a[i] - x(x指的是原本有x个"<a[i]"的数在a[i]的前边),所以如果我们知道一开始的sum,我们只需要给sum = sum + N - 1 - a[i] - x - (a[i] - x)也就是,sum = sum + N - 1 - 2 * a[i]。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
#define MP3(a, b, c) MP(MP(a, b), c)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 5e3 + 7;
int N, a[maxN], tree[maxN<<2], _UP, ans, sum;
inline void buildTree(int rt, int l, int r)
{
tree[rt] = 0;
if(l == r) return;
int mid = HalF;
buildTree(Lson); buildTree(Rson);
}
inline void update(int rt, int l, int r, int qx)
{
if(l == r) { tree[rt] = 1; return; }
int mid = HalF;
if(qx <= mid) update(Lson, qx);
else update(Rson, qx);
tree[rt] = tree[lsn] + tree[rsn];
}
inline int query(int rt, int l, int r, int ql, int qr)
{
if(ql <= l && qr >= r) return tree[rt];
int mid = HalF;
if(qr <= mid) return query(QL);
else if(ql > mid) return query(QR);
else return query(QL) + query(QR);
}
int main()
{
while(scanf("%d", &N) != EOF)
{
_UP = N - 1; ans = sum = 0;
buildTree(1, 0, _UP);
for(int i=1; i<=N; i++) scanf("%d", &a[i]);
for(int i=N; i>=1; i--) { sum += query(1, 0, _UP, 0, a[i]); update(1, 0, _UP, a[i]); }
ans = sum;
for(int i=1; i<N; i++) ans = min(ans, sum = sum + N - 1 - 2 * a[i]);
printf("%d\n", ans);
}
return 0;
}