제출 #329658

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
329658		anishrajeev	무제 (POI11_tem)	Java	0 / 100	849 ms	65536 KiB

Main

import java.io.*;
import java.util.*;

public class tem {
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        //BufferedReader bf = new BufferedReader(new FileReader("tester.in"));
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
        int N = Integer.parseInt(bf.readLine());
        pair[] x = new pair[N];
        pair[] temps = new pair[N];
        for(int i = 0; i < N; i++){
            StringTokenizer stk = new StringTokenizer(bf.readLine());
            int a = Integer.parseInt(stk.nextToken());
            int b = Integer.parseInt(stk.nextToken());
            temps[i] = new pair(a, b);
        }
        x[N-1] = new pair(1, temps[N-1].y);
        for(int i = N-2; i >= 0; i--){
            int match = match(temps[i], temps[i+1], x[i+1]);
            if(match != -1)x[i] = new pair(x[i+1].x+1, match);
            else x[i] = new pair(1, temps[i].y);
        }
        int answer = 0;
        for(int i = 0; i < N; i++) answer = Math.max(answer, x[i].x);
        System.out.println(answer);
    }
    public static int match(pair p1, pair p2, pair x){
        //p1 = temp[i]
        //p2 = temp[i+1]
        //x = x[i+1]
        if(p1.x <= x.y && x.y <= p1.y) return x.y;
        if(p1.y <= x.y)return p1.y;
        return -1;
    }
    public static class pair{
        int x, y;
        public pair(int a, int b){
            x = a;
            y = b;
        }
    }
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9