hiho week 208 register

Ended

Participants:101

Verdict:Accepted
Score:100 / 100
Submitted:2018-06-28 15:49:52

Lang:Java

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
import java.util.Arrays;
import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int len = in.nextInt();
        int[] A = new int[len];
        for(int i = 0i < leni++A[i= in.nextInt();
        Main solution = new Main();
        System.out.println(solution.helper(A));
    }
    private int helper(int[] A){
        int[] B = Arrays.copyOf(A,A.length);
        Arrays.sort(B);
        int start = 0end = B.length - 1,index = 0;
        while(index <= end){
            if(A[index!= B[index]) break;
            index++;
        }
        start = index;
        if(start > endreturn 0;
        index = end;
        while(index > start){
            if(A[index!= B[index]) break;
            index--;
        }
        end = index;
        return end - start + 1;
    }
}
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX