CodeForces 764B Timofey and cubes

题目链接：http://codeforces.com/contest/764/problem/B
题意：给你一个长度为n的序列，你会进行一些步操作，第i步，就是将序列i到n-i+1进行翻转操作，让你输出翻转操作的结果
解析：偶数位相当于没翻转过，奇数位就先交换a[i]和a[n-i+1]，然后输出a[i],到n/2时，停止交换操作

#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#include <cstring>#include <queue>#include <map>using namespace std;const int maxn = 2e5+100;const int inf = 0x7fffffff;int a[maxn];int main(void){    int n;    scanf("%d",&n);    for(int i=1;i<=n;i++)        scanf("%d",&a[i]);    for(int i=1;i<=n;i++)    {        if(i!=1)printf(" ");        if(i%2 && i<=n/2)            swap(a[i],a[n-i+1]);        printf("%d",a[i]);    }    puts("");    return 0;}