1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
const int MAXN=1e5+10;
int n;
int a[MAXN];
int main(){
    scanf("%d",&n);
    if(n%2){
        a[n/2]=n;
        int idx=1;
        int tmp=n/2;
        while(tmp+idx<n){
            a[tmp+idx]=(n-idx*2+1);
            a[tmp-idx]=(n-idx*2);
            idx++;
        }
    }else{
        int tmp1=n/2;
        int tmp2=n/2-1;
        int idx=1;
        while(tmp1<n){
            a[tmp1++]=n-idx+1;
            a[tmp2--]=n-idx;
            idx+=2;
        }
    }
    for(int i=0;i<n;i++){
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX