-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtry.java
More file actions
70 lines (67 loc) · 1.85 KB
/
try.java
File metadata and controls
70 lines (67 loc) · 1.85 KB
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
/* package codechef; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
class main
{
public static void main (String[] args) throws java.lang.Exception
{
// your code goes here
Scanner sc=new Scanner(System.in);
int n=sc.hasNextInt()?sc.nextInt():0;
int[] ar=new int[n];
int q=sc.hasNextInt()?sc.nextInt():0;
for(int i=0;i<n;++i){
ar[i]=sc.hasNextInt()?sc.nextInt():0;
}
int [] inc=new int[n];
int [] dec=new int[n];
int pt=1;
for(int i=1;i<n;++i){
i--;
if((i+1)<n){
if(ar[i]<ar[i+1]){
while(ar[i]<ar[i+1]){
if(inc[i]==0)
inc[i]=pt;
i++;
if((i+1)>=n)
break;
}
inc[i]=pt;
pt++;
}
}
if((i+1)<n){
if(ar[i]>ar[i+1]){
while(ar[i]>ar[i+1]){
if(inc[i]==0)
inc[i]=pt;
i++;
if((i+1)>=n)
break;
}
inc[i]=pt;
pt++;
}
}
}
System.out.println(Arrays.toString(inc))
while(q>0){
int l=sc.hasNextInt()?sc.nextInt():0;
int r=sc.hasNextInt()?sc.nextInt():0;
l--;
int ans;
if(inc[l]==inc[l+1])
ans=inc[r-1]-inc[l]+1;
else
ans=inc[r-1]-inc[l];
if(ans%2==0)
System.out.println("YES");
else
System.out.println("NO");
q--;
}
}
}