poj 1083

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

public class Main {

    // 定义一个200的数组来表示过道，没经过一次都加一，然后排序，最大值*10就是结果
    public static void main(String[] args) throws Exception {
        BufferedReader reader = new BufferedReader(new InputStreamReader(
                System.in));
        int numOfTestCase = Integer.parseInt(reader.readLine());
        for (int i = 0; i < numOfTestCase; i++) {
            int[] times = new int[200];
            int numOfTables = Integer.parseInt(reader.readLine());
            for (int j = 0; j < numOfTables; j++) {
                String line = reader.readLine();
                String[] nums = line.split(" ");
                int t1 = Integer.parseInt(nums[0]);
                int t2 = Integer.parseInt(nums[1]);
                if(t1 > t2){
                    int tmp = t2;
                    t2 = t1;
                    t1 = tmp;
                }
                int s1 = 0;
                if (t1 % 2 != 0) {
                    s1 = t1 / 2;
                } else {
                    s1 = t1 / 2 - 1;
                }
                int s2 = 0;
                if (t2 % 2 != 0) {
                    s2 = t2 / 2;
                } else {
                    s2 = t2 / 2 - 1;
                }
                for (int k = s1; k <= s2; k++) {
                    times[k]++;
                }
            }
            Arrays.sort(times);

            System.out.println(times[199] * 10);
        }
    }
}

需要注意：

1. 给出的数据中s不一定大于t

2. 定义一个数组表示走廊，每次被经过都++，最后sort，最大值*10