[백준/Java] 34935번 오름차순과 비내림차순

-Code

import java.util.Arrays;
import java.util.Scanner;

public class BOJ34935 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        long[] nums = new long[n];

        for (int i = 0; i < n; i++) {
            nums[i] = sc.nextLong();
        }

        boolean flag = true;
        for (int i = 1; i < n; i++) {
            if (nums[i - 1] >= nums[i]) {
                flag = false;
                break;
            }
        }
        System.out.println(flag ? 1 : 0);
    }
}