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());
int[] min = new int[N];
int[] max = new int[N];
/*for(int i = 0; i < N; i++){
StringTokenizer stk = new StringTokenizer(bf.readLine());
min[i] = Integer.parseInt(stk.nextToken());
max[i] = Integer.parseInt(stk.nextToken());
}*/
int num = Integer.MIN_VALUE;
int count = 0;
int answer = 0;
int mins = 0;
int maxs = 0;
boolean read = true;
for(int i = 0; i < N; i++){
if(read){
StringTokenizer stk = new StringTokenizer(bf.readLine());
mins = Integer.parseInt(stk.nextToken());
maxs = Integer.parseInt(stk.nextToken());
}
read = true;
if(mins>=num||maxs>=num){
count++;
if(mins>=num)num = mins;
else if(mins<=num&&num<=maxs)num = num;
else num = maxs;
}
else{
num = mins;
i--;
answer = Math.max(answer, count);
count=0;
read = false;
}
}
System.out.println(answer);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
74 ms |
8556 KB |
Output is correct |
2 |
Correct |
89 ms |
8556 KB |
Output is correct |
3 |
Correct |
81 ms |
8428 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
74 ms |
8556 KB |
Output is correct |
2 |
Incorrect |
74 ms |
8684 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
320 ms |
14288 KB |
Output is correct |
2 |
Incorrect |
272 ms |
14072 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
384 ms |
19284 KB |
Output is correct |
2 |
Incorrect |
397 ms |
19388 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
548 ms |
21572 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
537 ms |
21616 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
585 ms |
22972 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
595 ms |
22296 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
528 ms |
22360 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
438 ms |
21692 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
525 ms |
20772 KB |
Output is correct |
2 |
Runtime error |
644 ms |
44212 KB |
Memory limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
530 ms |
21072 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |