(SPOJ) 19940 - Consecutivos - Solução
import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
Main processando = new Main();
processando.processa();
System.exit(0);
}
static int leitor(BufferedReader br) throws NumberFormatException, IOException {
int n;
int resp = 0;
int sinal = 1;
while (true) {
n = br.read();
if (n >= '0' && n <= '9') break;
if (n == '-') sinal = -1;
if (n == '+') sinal = 1;
}
while (true) {
resp = resp*10 + n-'0';
n = br.read();
if (n < '0' || n > '9') break;
}
return resp*sinal;
}
void processa() throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int qteNumeros = leitor(br);
int[] vetor = new int[qteNumeros];
for (int i = 0; i < qteNumeros; i++) {
vetor[i] = leitor(br);
}
int qte = 1;
int maiorQte = -1;
int anterior = 0;
for (int i = 1; i < qteNumeros; i++) {
if (vetor[i] == vetor[anterior]) {
qte++;
if (qte >= maiorQte) {
maiorQte = qte;
}
}
else {
qte = 1;
}
anterior++;
}
bw.write(maiorQte + "\n");
bw.flush();
bw.close();
return;
}
}
import java.util.*;
class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
Main processando = new Main();
processando.processa();
System.exit(0);
}
static int leitor(BufferedReader br) throws NumberFormatException, IOException {
int n;
int resp = 0;
int sinal = 1;
while (true) {
n = br.read();
if (n >= '0' && n <= '9') break;
if (n == '-') sinal = -1;
if (n == '+') sinal = 1;
}
while (true) {
resp = resp*10 + n-'0';
n = br.read();
if (n < '0' || n > '9') break;
}
return resp*sinal;
}
void processa() throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int qteNumeros = leitor(br);
int[] vetor = new int[qteNumeros];
for (int i = 0; i < qteNumeros; i++) {
vetor[i] = leitor(br);
}
int qte = 1;
int maiorQte = -1;
int anterior = 0;
for (int i = 1; i < qteNumeros; i++) {
if (vetor[i] == vetor[anterior]) {
qte++;
if (qte >= maiorQte) {
maiorQte = qte;
}
}
else {
qte = 1;
}
anterior++;
}
bw.write(maiorQte + "\n");
bw.flush();
bw.close();
return;
}
}
Comments
Post a Comment