알고리즘
[백준] 14659 - 한조서열정리하고옴ㅋㅋ
JH_Lucid
2021. 6. 9. 14:31
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
int[] arr = new int[N];
StringTokenizer st = new StringTokenizer(br.readLine(), " ");
for(int i=0; i<N; i++) {
arr[i] = Integer.parseInt(st.nextToken());
}
int max = Integer.MIN_VALUE;
for(int i=0; i<N; i++) {
int count = 0;
for(int j=i+1; j<N; j++) {
if(arr[i] > arr[j]) {
count++;
} else
break;
}
max = Math.max(max, count);
}
System.out.println(max);
}
}