CF852C.Property
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Bill is a famous mathematician in BubbleLand. Thanks to his revolutionary math discoveries he was able to make enough money to build a beautiful house. Unfortunately, for not paying property tax on time, court decided to punish Bill by making him lose a part of his property.
Bill’s property can be observed as a convex regular 2n -sided polygon A0 A1... A2n−1 A2n, A2n= A0 , with sides of the exactly 1 meter in length.
Court rules for removing part of his property are as follows:
- Split every edge Ak Ak+1, k=0... 2n−1 in n equal parts of size 1/n with points P0,P1,...,Pn−1
- On every edge A2k A2k+1, k=0... n−1 court will choose one point B2k= Pi for some i=0,..., n−1 such that
- On every edge A2k+1A2k+2, k=0...n−1 Bill will choose one point B2k+1= Pi for some i=0,..., n−1 such that
- Bill gets to keep property inside of 2n -sided polygon B0 B1... B2n−1
Luckily, Bill found out which B2k points the court chose. Even though he is a great mathematician, his house is very big and he has a hard time calculating. Therefore, he is asking you to help him choose points so he maximizes area of property he can keep.
输入格式
The first line contains one integer number n (2<=n<=50000) , representing number of edges of 2n -sided polygon.
The second line contains n distinct integer numbers B2k (0<=B2k<=n−1, k=0... n−1) separated by a single space, representing points the court chose. If B2k=i , the court chose point Pi on side A2k A2k+1 .
输出格式
Output contains n distinct integers separated by a single space representing points B1,B3,...,B2n−1 Bill should choose in order to maximize the property area. If there are multiple solutions that maximize the area, return any of them.
输入输出样例
输入#1
3 0 1 2
输出#1
0 2 1
说明/提示
To maximize area Bill should choose points: B1=P0 , B3=P2 , B5=P1