알고리즘/JAVA
2. 보이는 학생
vivi
2021. 8. 31. 19:11
import java.util.*;
class Main {
public int solution(int[] input) {
int answer = 0;
int max = Integer.MIN_VALUE;
for (int i = 0; i < input.length; i++) {
if (input[i] > max) {
answer++;
max = input[i];
}
}
return answer;
}
public static void main(String[] args) {
Main T = new Main();
Scanner kb = new Scanner(System.in);
int num = kb.nextInt();
int[] input = new int[num];
for (int i = 0; i < num; i++)
input[i] = kb.nextInt();
System.out.print(T.solution(input));
}
}