转载自https://blog.csdn.net/xijujie/article/details/53236387
//建立邻接表
//随时将入度变为0的数放入优先队列
//每次出队即输出，队空时结束
#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
int num[N], indegree[N];
struct cmp {bool operator()(int i, int j) {return num[i] > num[j];}
};
int main() {int i, j, n, m, k, flag = 0;scanf("%d", &n);vector<vector<int> > g(n);priority_queue<int, vector<int>, cmp> q;//优先队列for (i = 0; i < n; i++){cin>>num[i];} //举个例子 34for (i = 0; i < n; i++) {if (num[i]>0) {
//已有的k = num[i] % n;//计算key k=34%11=1indegree[i] = (i + n - k) % n;//入度=这个公式 线性探测：冲突点往后找直到可以放，利用了这个原理//入度为3，即有三个排在他前面if (indegree[i]) {for (j = 0; j <indegree[i]; j++) g[(k + j) % n].push_back(i);//按照对应关系放进二维数组}// 1-4// 2-4// 3-4else q.push(i);//入度为0随时放进优先队列}}while (!q.empty()) {
//优先队列不为空i = q.top();q.pop();//输出最小的if (!flag) {flag = 1;printf("%d", num[i]);}else printf(" %d", num[i]);for (j = 0; j < g[i].size(); j++) {
//相应的入度-- 等于0的放进优先队列if (--indegree[g[i][j]] == 0)q.push(g[i][j]);}}return 0;
}