题目连接:11129 - An antiarithmetic permutation
题目大意:给出一个数值n, 要求用0~n - 1这n个数组成一个序列,使得这个序列的所有长度大于三的子序列都不是等差数列。
解题思路:每次把数列的奇数位和偶数位分开放到两边, 递归到最后就是答案。
#include <stdio.h>
#include <string.h>
const int N = 10010;
int n, ans[N];
void solve(int begin, int end) {
if (begin == end) return;
int tmp[N], pos = begin;
memcpy(tmp, ans, sizeof(ans));
for (int i = begin; i <= end; i += 2)
ans[pos++] = tmp[i];
for (int i = begin + 1; i <= end; i += 2)
ans[pos++] = tmp[i];
solve(begin, (begin + end) / 2);
solve((begin + end) / 2 + 1, end);
}
void output() {
printf("%d:", n);
for (int i = 0; i < n; i++)
printf(" %d", ans[i]);
printf("\n");
}
int main() {
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++)
ans[i] = i;
solve(0, n - 1);
output();
}
return 0;
}