码迷,mamicode.com
首页 > 其他好文 > 详细

codeforce 985A Chess Placing(暴力)

时间:2018-05-23 23:42:08      阅读:241      评论:0      收藏:0      [点我收藏+]

标签:nbsp   ssi   18C   clipboard   hat   mini   class   strategy   The   

Chess Placing
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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
2
input
Copy
10
1 2 3 4 5
output
Copy
10
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(暴力)

标签:nbsp   ssi   18C   clipboard   hat   mini   class   strategy   The   

原文地址:https://www.cnblogs.com/caiyishuai/p/9080107.html

(0)
(0)
   
举报
评论 一句话评论(0
0条  
登录后才能评论!
© 2014 mamicode.com 版权所有 京ICP备13008772号-2
迷上了代码!