forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
53 lines (50 loc) · 1.16 KB
/
Copy pathB.cpp
File metadata and controls
53 lines (50 loc) · 1.16 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <string>
#include <cstring>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
#define FOREACH(it,c) for(typeof((c).begin())it=(c).begin();it!=(c).end();++it)
#define CLR(x) memset((x),0,sizeof((x)))
#define MP make_pair
#define MPI make_pair<int, int>
#define PB push_back
typedef long long LL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int, int> PI;
void run() {
int N;
cin >> N;
VI mm(N);
REP(i,N) cin >> mm[i];
int res = 0;
REP(i,N) {
int s1 = 0, s2 = 0;
FOR(j,0,i-1) if (mm[j] > mm[i]) ++s1;
FOR(j,i+1,N-1) if (mm[j] > mm[i]) ++s2;
res += min(s1, s2);
}
cout << res << endl;
}
int main() {
int nk;
cin >> nk;
FOR(c,1,nk) {
cout << "Case #" << c << ": ";
run();
}
return 0;
}