题解 | 植树节-Java

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] diff = new int[1000002];

        while (n-- > 0) {
            int ai = in.nextInt();
            int bi = in.nextInt();
            diff[ai] += 1;
            diff[bi + 1] -= 1;
        }

        int max = diff[0];
        for (int i = 1; i <= 1000000; i++) {
            diff[i] = diff[i - 1] + diff[i];
            max = Math.max(diff[i], max);
        }

        System.out.println(max);

    }
}