Submission #64568

---

Source Code Expand

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		doIt();
	}

	static void doIt(){
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.nextLine());
		boolean[] days = new boolean[366];
		int[] month = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
		int[] months = new int[12];
		int sum = 0;
		for(int i = 6; i < 366; i+=7) days[i] = true;
		for(int i = 7; i < 366; i+=7) days[i] = true;
		for(int i = 0; i < 12; i++){
			months[i] = sum;
			sum += month[i];
		}
		CC[] ary = new CC[n];
		for(int i = 0; i < n; i++){
			String s = sc.nextLine();
			String[] ss = s.split("/");
			int m = Integer.parseInt(ss[0]);
			int d = Integer.parseInt(ss[1]);
			ary[i] = new CC(m, d);
		}
		Arrays.sort(ary);
		for(int i =0; i < n; i++){
			CC cc = ary[i];
			int m = cc.m;
			int d = cc.d;
			int p = months[m - 1] + d - 1;
			while(p < 366){
				if(days[p] == false){days[p] = true;break;}
				p++;
			}
		}
		int max = 0;
		int ii = 0;
		while(ii < 366){
			if(days[ii]){
				int count = 0;
				while(ii < 366 && days[ii]){
					count++;
					ii++;
				}
				max = max < count? count : max;
			}
			else ii++;
		}
		/*int count = 0;
		while(ii < 366){
			if(days[ii]) count++;
			else{
				max = Math.max(max, count);
				count = 0;
			}
			ii++;
		}
		max = Math.max(max, count);*/
		System.out.println(max);
	}
}

class CC implements Comparable {
	int m;
	int d;
	CC(int mm, int dd){
		m = mm;
		d = dd;
	}
	public int compareTo(Object other) {

		CC o = (CC) other;
		if(m == o.m) return d - o.d;
		else return m - o.m;
	}
}

Submission Info

Judge Result