DataStructure-Algorithm-in-java/decorinc.java at master · 14visheshjain/DataStructure-Algorithm-in-java · GitHub

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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
package lecture3;

import java.util.Scanner;

public class decorinc {

	//static Scanner s = new Scanner(System.in);

	public static void main(String[] args) {
 Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		int j = 1;
		int retainer = 1;
		int prev = 0, check = 0;
		while (j <= n) {
			int a = s.nextInt();

			if (j == 1)
				prev = a;
			else if (prev <= a) {
				if (check != 1) {
					check = 1;
					retainer *= 10;
				}

			} else if (prev > a) {
				if (check != 2) {
					check = 2;
					retainer *= 10;
				}

			}
			prev = a;
			j++;
		}
		if (retainer <= 100)
			System.out.println("yes");
		else
			System.out.println("no");
	//	check(n);
		s.close();

	}

	public static void check(int n) {
//		Scanner a = new Scanner(System.in);
//		int j = 1;
//		int retainer = 1;
//		int prev = 0, check = 0;
//		while (j <= n) {
//			int a = s.nextInt();
//
//			if (j == 1)
//				prev = a;
//			else if (prev <= a) {
//				if (check != 1) {
//					check = 1;
//					retainer *= 10;
//				}
//
//			} else if (prev > a) {
//				if (check != 2) {
//					check = 2;
//					retainer *= 10;
//				}
//
//			}
//			prev = a;
//			j++;
//		}
//		if (retainer <= 100)
//			System.out.println("yes");
//		else
//			System.out.println("no");
	}
}