解题思路:
注意事项:
参考代码:
import java.util.Scanner; public class A1262 { public static void main(String args[]) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int x[] = new int[n]; int y[] = new int[n]; for (int i = 0; i < n; i++) { x[i] = sc.nextInt(); y[i] = sc.nextInt(); } int minx = Integer.MAX_VALUE; int miny = Integer.MAX_VALUE; ; for (int i = 0; i < n; i++) { int sumx = 0; int sumy = 0; int d = x[i]; int f = y[i]; for (int j = 0; j < n; j++) { sumx = sumx + Math.abs(d - x[j]); sumy = sumy + Math.abs(f - y[j]); } if (sumx < minx) minx = sumx; if (sumy < miny) { miny = sumy; } } System.out.println(minx + miny); } }
0.0分
3 人评分
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:520 |
1017题解浏览:585 |
母牛的故事 (C语言代码)浏览:940 |
1124题解浏览:591 |
循环入门练习5 (C语言代码)浏览:829 |
The 3n + 1 problem (C语言代码)浏览:501 |
矩形面积交 (C语言代码)浏览:1294 |
勾股数 (C语言代码)浏览:799 |
C语言程序设计教程(第三版)课后习题5.7 (C语言代码)浏览:756 |
数列有序 (C语言代码)浏览:930 |