HDU - Permutation(构造，思维)

题目传送
题意:
给你一个排列n(也就是元素从1到n)，现在让你构造一下这个数组，使得a[i] % | a[i] - a[i-2] | == 0(a[i] - a[i-2]的绝对值,i >= 3)。

思路:
如果我使得a[i] - a[i-2] == 1，那么不就万能啦?!

AC代码

#include <bits/stdc++.h>
inline long long read(){char c = getchar();long long x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) (x)&(-x)
const int N = 1e6 + 10;
const long long INFINF = 0x7f7f7f7f7f7f7f;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-7;
const unsigned long long mod = 1e9+7;
const double II = acos(-1);
const double PP = (II*1.0)/(180.00);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> piil;
int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t;
    cin >> t;
    while(t--)
    {
        int n;
        cin >> n;
        int num = 1,arr[n+5] = {0};
        for(int i = 1;i <= n;i += 2) arr[i] = num++;
        for(int i = 2;i <= n;i += 2) arr[i] = num++;
        for(int i = 1;i <= n;i++) i != n ? cout << arr[i] << " " : cout << arr[i] << endl;
    }
}