int main() { int n, m; cin >> n >> m; vector<int> nums(n, 0); unordered_map<int, int> mp; set<int> st; for (int i = 0; i != n; ++i) { cin >> nums[i]; mp[nums[i]] = i; st.insert(nums[i]); } int flag = 0;//A队挑选 string res(n, 'C'); while (!st.empty()) { int select = *st.rbegin(); int index = mp[select]; int count1 = 1, count2 = 1; int change1 = 0, change2 = 0; char c = 'A'; if (flag == 0) flag = 1; else { c = 'B'; flag = 0; } res[index] = c; st.erase(select); while (change1 < m &;&; index - count1 >= 0) { if (res[index - count1] == 'C') { res[index - count1] = c; st.erase(nums[index - count1]); ++change1; } ++count1; } while (change2 < m &;&; index + count2 < n) { if (res[index + count2] == 'C') { res[index + count2] = c; st.erase(nums[index + count2]); ++change2; } ++count2; } } cout << res << endl; //system("pause"); return 0; }