Codeforces Round 201 (Div. 2)

2 problems from Codeforces Round 201 (Div. 2) (contest 347), difficulty 1100-1300. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 201 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1100-1300 | 4m 30s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Difference Row	1300	constructive-algorithms, implementation, sortings	9,797	1m 14s	✓
B	Fixed Points	1100	brute-force, implementation, math	9,869	3m 16s	✓

Practice › Codeforces Solutions › Codeforces Round 201 (Div. 2) ›

CF 347A - Difference Row

We are given a list of n integers and need to arrange them in a row such that the sum of differences between consecutive numbers is maximized. Concretely, if the arrangement is $x1, x2, dots, xn$, the value is calculated as $(x1 - x2) + (x2 - x3) + dots + (x{n-1} - xn)$.

Practice › Codeforces Solutions › Codeforces Round 201 (Div. 2) ›

CF 347B - Fixed Points

We are given a permutation of numbers from 0 to n − 1, stored in an array where each index represents a position and the value at that index represents where that position “points”. A position i is called a fixed point if the value stored at that position is exactly i.