CF1252A.Copying Homework

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Danang and Darto are classmates. They are given homework to create a permutation of NN integers from 11 to NN . Danang has completed the homework and created a permutation AA of NN integers. Darto wants to copy Danang's homework, but Danang asks Darto to change it up a bit so it does not look obvious that Darto copied.

The difference of two permutations of NN integers AA and BB , denoted by diff(A,B)diff(A, B) , is the sum of the absolute difference of AiA_i and BiB_i for all ii . In other words, diff(A,B)=Σi=1NAiBidiff(A, B) = \Sigma_{i=1}^N |A_i - B_i| . Darto would like to create a permutation of NN integers that maximizes its difference with AA . Formally, he wants to find a permutation of NN integers BmaxB_{max} such that diff(A,Bmax)diff(A,B)diff(A, B_{max}) \ge diff(A, B') for all permutation of NN integers BB' .

Darto needs your help! Since the teacher giving the homework is lenient, any permutation of NN integers BB is considered different with AA if the difference of AA and BB is at least NN . Therefore, you are allowed to return any permutation of NN integers BB such that diff(A,B)Ndiff(A, B) \ge N .

Of course, you can still return BmaxB_{max} if you want, since it can be proven that diff(A,Bmax)Ndiff(A, B_{max}) \ge N for any permutation AA and N>1N > 1 . This also proves that there exists a solution for any permutation of NN integers AA . If there is more than one valid solution, you can output any of them.

输入格式

Input begins with a line containing an integer: NN ( 2N1000002 \le N \le 100\,000 ) representing the size of Danang's permutation. The next line contains NN integers: AiA_i ( 1AiN1 \le A_i \le N ) representing Danang's permutation. It is guaranteed that all elements in AA are distinct.

输出格式

Output in a line NN integers (each separated by a single space) representing the permutation of NN integers BB such that diff(A,B)Ndiff(A, B) \ge N . As a reminder, all elements in the permutation must be between 11 to NN and distinct.

输入输出样例

  • 输入#1

    4
    1 3 2 4
    

    输出#1

    4 2 3 1
    
  • 输入#2

    2
    2 1
    

    输出#2

    1 2
    

说明/提示

Explanation for the sample input/output #1

With A=[1,3,2,4]A = [1, 3, 2, 4] and B=[4,2,3,1]B = [4, 2, 3, 1] , diff(A,B)=14+32+23+41=3+1+1+3=8diff(A, B) = |1 - 4| + |3 - 2| + |2 - 3| + |4 - 1| = 3 + 1 + 1 + 3 = 8 . Since 848 \ge 4 , [4,2,3,1][4, 2, 3, 1] is one of the valid output for this sample.

首页