package com.javarush.task.task08.task0812;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
/*
Cамая длинная последовательность
*/
public class Solution {
public static void main(String[] args) throws IOException {
int longestSequence = 1;
int currentSequence = longestSequence;
List <Integer> nums = new ArrayList<>(10);
BufferedReader buff = new BufferedReader(new InputStreamReader(System.in));
for (int i = 0; i < 10; i++) {
nums.add(Integer.parseInt(buff.readLine()));
}
for (int i = 0; i < 9; i++) {
if (nums.get(i) == nums.get(i+1)) {
currentSequence++;
if(currentSequence > longestSequence) {
longestSequence = currentSequence;
}
} else {
currentSequence = 1;
}
}
System.out.print(longestSequence);
}
}
package com.javarush.task.task08.task0812;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
/*
Cамая длинная последовательность
*/
public class Solution {
public static void main(String[] args) throws IOException {
int longestSequence = 1;
int currentSequence = longestSequence;
List <Integer> nums = new ArrayList<>(10);
BufferedReader buff = new BufferedReader(new InputStreamReader(System.in));
for (int i = 0; i < 10; i++) {
int num = Integer.parseInt(buff.readLine());
nums.add(num);
}
for (int i = 0; i < 9; i++) {
if (nums.get(i) == nums.get(i+1)) {
currentSequence++;
if(longestSequence<currentSequence) {
longestSequence = currentSequence;
}
} else {
currentSequence = 1;
}
}
System.out.print(longestSequence);
}
}