tjut 2689

#include <iostream>  
#include <cstdio>  
#include <cstring>  
using namespace std;  
  
#define N 1001  
  
int C[N];  
int num[N];  
int T;  
  
int Lowbit(int x){  
    return x&(x^(x-1));  
}  
  
void add(int pos,int num) {  
    while(pos <= N) {  
        C[pos] += num;  
        pos += Lowbit(pos);  
    }  
}  
  
int Sum(int end) {  
    int sum = 0;  
    while(end > 0) {  
        sum += C[end];  
        end -= Lowbit(end);  
    }  
    return sum;  
}  
  
int main() {  
    int s, t, i, j, T, ans;  
    while(~scanf("%d",&T)) {  
        memset(C,0,sizeof(C));  
        memset(num,0,sizeof(num));  
        ans = 0;  
        for(j = 0; j < T; j ++) {//因为第一个数前面比它小的数没有，所以j要从0开始  
            scanf("%d",&s);  
            add(s+1,1);  
            ans += j - Sum(s);//Sum(s)求的就是小于s的个数，j - Sum(s)就是前j个数中大于s的个数  
        }  
        printf("%d\n",ans);  
  
    }  
    return 0;  
}