codeforce 985A Chess Placing(暴力）

Posted 2020-11-08 蔡军帅

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了codeforce 985A Chess Placing(暴力）相关的知识，希望对你有一定的参考价值。

You are given a chessboard of size 1?×?n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW".

Some cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is known that the total number of pieces equals to $技术分享图片$ .

In one step you can move one of the pieces one cell to the left or to the right. You cannot move pieces beyond the borders of the board. You also cannot move pieces to the cells that are already occupied.

Your task is to place all the pieces in the cells of the same color using the minimum number of moves (all the pieces must occupy only the black cells or only the white cells after all the moves are made).

Input

The first line of the input contains one integer n (2?≤?n?≤?100, n is even) — the size of the chessboard.

The second line of the input contains $技术分享图片$ integer numbers $技术分享图片$ (1?≤?pi?≤?n) — initial positions of the pieces. It is guaranteed that all the positions are distinct.

Output

Print one integer — the minimum number of moves you have to make to place all the pieces in the cells of the same color.

Examples

input

Copy

6
1 2 6

output

Copy

input

Copy

10
1 2 3 4 5

output

Copy

Note

In the first example the only possible strategy is to move the piece at the position 6 to the position 5 and move the piece at the position 2 to the position 3. Notice that if you decide to place the pieces in the white cells the minimum number of moves will be 3.

In the second example the possible strategy is to move $技术分享图片$ in 4 moves, then $技术分享图片$ in 3 moves, $技术分享图片$ in 2 moves and $技术分享图片$ in 1 move.

两种情况分别跑一遍，求最少

#include <iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<deque>
#include<vector>
#define ll long long
#define inf 0x3f3f3f3f
#define mod 1000000007;
using namespace std;
int main()
{
    int n;
    std::cin>>n;
    int a[55];
    for(int i=1;i<=n/2;i++)
    {
        std::cin>>a[i];
    }
    sort(a+1,a+1+n/2);
    int s1=0;
    int s2=0;
    int c1=1;
    int c2=2;
    for(int i=1;i<=n/2;i++,c1+=2,c2+=2)
    {
        s1+=abs(a[i]-c1);
        s2+=abs(a[i]-c2);
    }
    s1=min(s2,s1);
    std::cout<<s1;
    return 0;
}

以上是关于codeforce 985A Chess Placing(暴力）的主要内容，如果未能解决你的问题，请参考以下文章

Codeforces 38B - Chess

codeforces 845A Chess Tourney

@codeforces - 793G@ Oleg and chess

CodeForces-38B-Chess枚举+思维

codeforces 7 A. Kalevitch and Chess

Codeforces Round #379 (Div. 2) D. Anton and Chess（模拟）