HDU 5122 K.Bro Sorting（2014北京区域赛现场赛K题 模拟）

 1 //#pragma comment(linker, "/STACK:16777216") //for c++ Compiler
 2 #include <stdio.h>
 3 #include <iostream>
 4 #include <cstring>
 5 #include <cmath>
 6 #include <stack>
 7 #include <queue>
 8 #include <vector>
 9 #include <algorithm>
10 #define ll long long
11 #define Max(a,b) (((a) > (b)) ? (a) : (b))
12 #define Min(a,b) (((a) < (b)) ? (a) : (b))
13 #define Abs(x) (((x) > 0) ? (x) : (-(x)))
14 
15 using namespace std;
16 
17 const int INF  = 0x3f3f3f3f;
18 int a[1000001];
19 
20 int main(){
21     int i, j, k, t, n, m, numCase = 0;
22     scanf("%d",&t);
23     while(t--){
24         scanf("%d",&n);
25         for(i = 0; i < n; ++i)  scanf("%d",&a[i]);
26         int ans = 0;
27         for(i = n - 2; i >= 0; --i){
28             if(a[i] > a[i + 1]){
29                 swap(a[i], a[i + 1]);
30                 ++ans;
31             }
32         }
33         printf("Case #%d: %d\n",++numCase, ans);
34     }
35     return 0;
36 }