test-6-H

#include<iostream>//想到的最优解是找1-n依次把之前的数移到后面去。 #include<cstdio> using namespace std; typedef long long ll; const int N=1e6; int a[N+100],b[N+100]; int main() { int t,cas=1; scanf("%d",&t); while(t--) { int n;scanf("%d",&n); for(int i=1;i<=n;i++) {scanf("%d",&a[i]);b[a[i]]=i;} ll ans=0,per=0; for(int i=1;i<=n;i++) { if(b[i]>per) {ans+=b[i]-per-1;per=b[i];} } printf("Case #%d: %lld\n",cas++,ans); } return 0; } K.Bro Sorting