hdu 5122 简单题

//给定n个数   要使得其从小到大排好序之后问交换的最少次数是多少  逆序对才需要交换一下#include <iostream>#include <cstdio>#include <algorithm>using namespace std;int a[1000010];int main(){    int t,ii,n,i,Min,ans;    scanf("%d",&t);    for (ii=1; ii<=t; ii++)    {        scanf("%d",&n);        for (i=1; i<=n; i++)scanf("%d",&a[i]);        Min=a[n];//假定为最小的值        ans=0;        for (i=n-1; i>=1; i--)        {            if (a[i]>Min) ans++;            else Min=a[i];//保存最小的值        }        printf("Case #%d: %d\n",ii,ans);    }}