FZu 2134

/*该题本来是可以用树状数组写的
但是个人觉得简单,就用普通方法直接AC了,
*/
# include<iostream>
# include<cstdio>
# include<cstring>
# include<algorithm>
# include<cstdlib>
# include<string>
# include<cmath>
using namespace std;
int s[108];
int i,j;
int main()
{
	int t;
	cin>>t;
	int x;
	while(t--)
	{
	int sum=0;
		cin>>x;
		for(int i=0;i<x;i++)
		{
			cin>>s[i];
		} 
	    for(int i=0;i<x;i++)
	    {
    	  for(int j=i+1;j<x;j++)
		  {
  			if(s[i]<s[j]) sum++;
  		  } 
    	}
    	cout<<sum<<endl;
	} 
    return 0;
}

你可能感兴趣的:(FZU,2134)