zoukankan      html  css  js  c++  java
  • Codeforces Round #395 (Div. 2)B. Timofey and cubes

    地址:http://codeforces.com/contest/764/problem/B

    题目:

    B. Timofey and cubes
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Young Timofey has a birthday today! He got kit of n cubes as a birthday present from his parents. Every cube has a number ai, which is written on it. Timofey put all the cubes in a row and went to unpack other presents.

    In this time, Timofey's elder brother, Dima reordered the cubes using the following rule. Suppose the cubes are numbered from 1 to n in their order. Dima performs several steps, on step i he reverses the segment of cubes from i-th to (n - i + 1)-th. He does this while i ≤ n - i + 1.

    After performing the operations Dima went away, being very proud of himself. When Timofey returned to his cubes, he understood that their order was changed. Help Timofey as fast as you can and save the holiday — restore the initial order of the cubes using information of their current location.

    Input

    The first line contains single integer n (1 ≤ n ≤ 2·105) — the number of cubes.

    The second line contains n integers a1, a2, ..., an ( - 109 ≤ ai ≤ 109), where ai is the number written on the i-th cube after Dima has changed their order.

    Output

    Print n integers, separated by spaces — the numbers written on the cubes in their initial order.

    It can be shown that the answer is unique.

    Examples
    input
    7
    4 3 7 6 9 1 2
    output
    2 3 9 6 7 1 4
    input
    8
    6 1 4 2 5 6 9 2
    output
    2 1 6 2 5 4 9 6
    Note

    Consider the first sample.

    1. At the begining row was [2, 3, 9, 6, 7, 1, 4].
    2. After first operation row was [4, 1, 7, 6, 9, 3, 2].
    3. After second operation row was [4, 3, 9, 6, 7, 1, 2].
    4. After third operation row was [4, 3, 7, 6, 9, 1, 2].
    5. At fourth operation we reverse just middle element, so nothing has changed. The final row is [4, 3, 7, 6, 9, 1, 2]. So the answer for this case is row [2, 3, 9, 6, 7, 1, 4].

     思路:水题,看代码即可

    代码

     1 #include <bits/stdc++.h>
     2 
     3 using namespace std;
     4 
     5 #define MP make_pair
     6 #define PB push_back
     7 typedef long long LL;
     8 typedef pair<int,int> PII;
     9 const double eps=1e-8;
    10 const double pi=acos(-1.0);
    11 const int K=1e6+7;
    12 const int mod=1e9+7;
    13 
    14 int n,a[K];
    15 int main(void)
    16 {
    17     cin>>n;
    18     for(int i=1;i<=n;i++)cin>>a[i];
    19     for(int i=1;i<=n-i+1;i++)
    20     if(i&1)
    21         swap(a[i],a[n-i+1]);
    22     for(int i=1;i<=n;i++)
    23         printf("%d ",a[i]);
    24 
    25     return 0;
    26 }

     

  • 相关阅读:
    [C# 基础知识系列]专题六:泛型基础篇——为什么引入泛型
    [C#基础知识系列]专题十七:深入理解动态类型
    [C# 基础知识系列]专题九: 深入理解泛型可变性
    C#网络编程系列文章索引
    [C#基础知识系列]专题十:全面解析可空类型
    [C# 基础知识系列]专题十一:匿名方法解析
    [C# 基础知识系列]专题十六:Linq介绍
    VSTO之旅系列(一):VSTO入门
    [C# 网络编程系列]专题七:UDP编程补充——UDP广播程序的实现
    [C# 网络编程系列]专题四:自定义Web浏览器
  • 原文地址:https://www.cnblogs.com/weeping/p/6362465.html
Copyright © 2011-2022 走看看