1056 Mice and Rice (25分)

这个算是比较复杂了吧，我用到了好几种排序和容器。
测试点2的只有一个节点的情况。
其他情况如果答案错误，很可能是你没有把 末尾的人单独成组并晋级。

附本人AC代码：

#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
map<int, int >Ma, Mb;
bool cmp(int a, int b) {
	return Ma[a] > Ma[b];
}
int main() {
	int N, G, time = 0;
	scanf("%d%d", &N, &G);
	vector<int>V1(N), V2(N), V3, ans;
	for (int i = 0; i < N; i++) {
		scanf("%d", &V1[i]);
	}
	for (int i = 0; i < N; i++) {
		scanf("%d", &V2[i]);
	}
	if (V2.size() == 1) {
		printf("1");
		return 0;
	}
	while (V2.size() >= 2) {
		time++;
		V3.clear();
		int k = V2.size() % G;
		for (int i = 0; i + G <= V2.size()-k; i += G) {
			int max = V1[V2[i]], index = V2[i];
			for (int j = i + 1; j < i + G; j++) {
				if (V1[V2[j]] > max) {
					index = V2[j];
					max = V1[V2[j]];
				}
			}
			V3.push_back(index);
			Ma[index]++;
		}
		if (k != 0) {
			int max = V1[V2[V2.size() - k]], index = V2[V2.size() - k];
			for (int i = V2.size() - k + 1; i < V2.size(); i++) {
				if (V1[V2[i]] > max) {
					index = V2[i];
					max = V1[V2[i]];
				}
			}
			V3.push_back(index);
			Ma[index]++;
		}
		V2 = V3;
	}
	for (auto i = Ma.begin(); i != Ma.end(); i++) {
		ans.push_back(i->first);
	}
	sort(ans.begin(), ans.end(), cmp);
	Mb[ans[0]] = 1;
	for (int i = 1; i < ans.size(); i++) {
		if (Ma[ans[i]] == Ma[ans[i - 1]])Mb[ans[i]] = Mb[ans[i - 1]];
		else Mb[ans[i]] = i + 1;
	}
	int rank = Mb.size() + 1;
	for (int i = 0; i < N; i++) {
		printf(i == 0 ? "%d" : " %d", Mb[i] == 0 ? rank : Mb[i]);
	}
	return 0;
}