Codeforces Round #395 B

Timofey and cubes

题意：

思路：第奇数位数都没有改变位置，偶数位都与n-i+1调换了位置

AC代码：

#include "iostream"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#define ll long long
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a) memset(a,0,sizeof(a))
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
using namespace std;
const long long INF = 1e18+1LL;
const int inf = 1e9+1e8;
const int N=1e5+100;
const ll mod=1e9+7;

int n,a[2*N],g[2*N];
int main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n;
    for(int i=1; i<=n; ++i){
        cin>>a[i];
        if(i<=n-i+1){
            if(i&1){
                int m=n-i+1;
                g[i]=n-i+1,g[n-i+1]=i;
            }
        }
        if(g[i]==0) g[i]=i;
    }
    for(int i=1; i<=n; ++i){
        cout<<a[g[i]]<<" ";
    }
    return 0;
}