牛客网 2018校招真题 网易 堆棋子

Description

牛客网 2018校招真题 堆棋子

Solving Ideas

枚举所有棋子到每个可能的点(x,y)的曼哈顿距离，然后维护排序后的前k个点的最小值。

例如：若有棋子(x1,y1)和(x2,y2)，那么所有可能的点就是(x1,y1)，(x1,y2)，(x2,y1)，(x2,y2)，也即最优情况有可能不出现在任意一个原棋子的点上。

Time complexity : $O(n^{3}logn)$
Space complexity : $O(n)$

Solution

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

/**
 * @author wylu
 */
public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        String[] xs = br.readLine().split(" ");
        String[] ys = br.readLine().split(" ");
        int[] x = new int[n], y = new int[n];
        for (int i = 0; i < n; i++) {
            x[i] = Integer.parseInt(xs[i]);
            y[i] = Integer.parseInt(ys[i]);
        }


        int[] res = new int[n];
        for (int i = 0; i < n; i++) res[i] = Integer.MAX_VALUE;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                int[] dist = new int[n];
                for (int k = 0; k < n; k++) {
                    dist[k] = Math.abs(x[k] - x[i]) + Math.abs(y[k] - y[j]);
                }
                Arrays.sort(dist);
                for (int k = 0, sum = 0; k < n; k++) {
                    res[k] = Math.min(res[k], sum += dist[k]);
                }
            }
        }

        for (int i = 0; i < n - 1; i++) System.out.print(res[i] + " ");
        System.out.println(res[n - 1]);
    }
}