求助 为什么只有第二个点错了 答案行数不对……

#include<vector>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define v1 (i+d)%n
#define v2 (i-d+n)%n
inline int read() {
	int s = 0, f = 1; char c = getchar(); while (c<'0' || c>'9') { if (c == '-') f = -1; c = getchar(); }
	while (c >= '0'&&c <= '9') { s = s * 10 + c - '0'; c = getchar(); }
	return s*f;
}
int n;
const int maxn = 10007;
vector<int> g[maxn << 1];
bool vis[maxn << 1];
int link[maxn << 1],ans[maxn<<1];
bool dfs(int u) {
	for (int i = 0; i < g[u].size(); i++) {
		int v = g[u][i];
		if (!vis[v]) {
			vis[v] = true;
			if (link[v]==-1 || dfs(link[v])) {
				link[v] = u;
				ans[u] = v;
				return true;
			}
		}
	}
	return false;
}
int hungary() {
	int res = 0;
	memset(link, -1, sizeof(link));
	for (int i = n - 1; i >= 0; i--) {
		memset(vis, false, sizeof(vis));
		if (!dfs(i)) {
			puts("No Answer");
			return -1;
		}
		res++;
	}
	//printf("%d\n", res);
	return res;
}
int main() {
	n = read();
	int d;
	for (int i = 0; i < n; i++) {
		d = read();
		g[i].push_back(v1);
		g[i].push_back(v2);
	}
	for (int i = 0; i < n; i++) sort(g[i].begin(), g[i].end());
	//保证在dfs过程中先考虑较小的那个点
	if (hungary() == n) {
		for (int i = 0; i < n - 1; i++)
			printf("%d ", ans[i]);
		printf("%d", ans[n - 1]);
	}
	else {
		puts("No Answer");
	}
	//getchar();
	return 0;
}