算法问题实战策略 SORTGAME

 1 #include <iostream>
 2 #include <vector>
 3 #include <algorithm>
 4 #include <queue>
 5 #include <map>
 6 
 7 using namespace std;
 8 
 9 int n, m;
10 
11 
12 int bfs(const vector<int>& v)
13 {
14     vector<int> sorted = v;
15     sort(sorted.begin(), sorted.end());
16     queue<vector<int>> q;
17     map<vector<int>, int> distance;
18     distance[v] = 0;
19     q.push(v);
20     while (!q.empty()) {
21         vector<int> here = q.front();
22         q.pop();
23 
24         if (here == sorted) return distance[here];
25         int cost = distance[here];
26         //翻转可能的子区间
27         for (int i = 0; i < v.size(); i++) {
28             for (int j = i + 2; j <= v.size(); ++j) {
29                 reverse(here.begin() + i, here.begin() + j);
30                 if (distance.count(here) == 0) {
31                     distance[here] = cost + 1;
32                     q.push(here);
33                 }
34                 reverse(here.begin() + i, here.begin() + j);
35             }
36         }
37     }
38 
39     return -1;
40 }
41 
42 
43 int main()
44 {
45     cin >> n;
46 
47     while (n--) {
48         cin >> m;
49         vector<int> v;
50         for (int i = 0; i < m; i++) {
51             int t;
52             cin >> t;
53             v.push_back(t);
54         }
55 
56         cout << bfs(v) << endl;
57     }
58 
59 
60     return 0;
61 }