코드포스 580A (codeforces 580A)
Algorithms / 코드포스 (codeforces)
Codeforces Codeforces 580a 코드포스 코드포스 580a Problem - 580a - codeforces
코드포스 580A (codeforces 580A) 문제 풀이 및 코드 (description and code)
Problem - 580A - Codeforces
코드
import java.io.*;
public class CF580A {
static int n;
static int[] a = new int[100002];
static String[] ins;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
n = Integer.parseInt(br.readLine());
ins = br.readLine().split(" ");
for (int i = 1; i <= n; i++) {
a[i] = Integer.parseInt(ins[i - 1]);
}
int max = 1, i = 1, count, cur = a[1];
while (i != n) {
count = 1;
for (int j = i + 1; j <= n; j++) {
if (j == n) i = n;
if (cur > a[j]) { i = j; cur = a[j];break; }
else {cur = a[j];count++;}
}
max = Math.max(max, count);
}
bw.write(max + "\n");bw.flush();
bw.close();
}
}