3536041_ac_391ms_4864k.java

来自「北大大牛代码 1240道题的原代码 超级权威」· Java 代码 · 共 47 行

import java.util.*;

public class Main {
	private Scanner in;

	public static void main(String [] args) {
		new Main().run();
	}

	private void run() {
		in = new Scanner(System.in);
		int n;
		int W, H, S, T;

		while (true) {
			n = in.nextInt();
			if (n == 0) {
				break;
			}
			int [][] point = new int [n][2];
			W = in.nextInt();
			H = in.nextInt();
			for (int i = 0; i < n; i++) {
				point[i][1] = in.nextInt();
				point[i][0] = in.nextInt();
			}
			S = in.nextInt();
			T = in.nextInt();
			int max = 0;
			for (int i = 1; i <= H - T + 1; i++) {
				for (int j = 1; j <= W - S + 1; j++) {
					int tmp = 0;
					for (int k = 0; k < n; k++) {
						if (point[k][0] >= i && point[k][1] >= j
								&& point[k][0] < i + T && point[k][1] < j + S) {
							tmp++;
						}
					}
					if (tmp > max) {
						max = tmp;
					}
				}
			}
			System.out.println(max);
		}
	}
}