-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCodechef ISBIAS JAN20B
90 lines (73 loc) · 2.23 KB
/
Codechef ISBIAS JAN20B
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,q;
cin>>n>>q;
int ar[n];
for(int i=0;i<n;i++){
cin>>ar[i];
}
vector<int>v;
for(int i=1;i<n;i++){
if(ar[i]>ar[i-1]){
if(v.size()==0){
v.push_back(i-1);
v.push_back(i);
}
else{
if(v.back()==i-1){
v.back()=i;
}
else{
v.push_back(i-1);
v.push_back(i);
}
}
}
}
/* for(int i=0;i<v.size();i++){
cout<<v[i]<<" ";
}
cout<<endl; */
while(q--){
long int l1, r1;
cin>>l1>>r1;
l1=l1-1;r1=r1-1;
int index1 ,index2;
string result; int t1=0,t2=0;
// first find right index using dp array V !
for(int i=0;i<v.size();i++){
if(l1==v[i]){
index1=i;
break;
}
else{
if(l1<v[i+1]){
index1=i;
break;}
}
}
for(int i=0;i<v.size();i++){
if(r1==v[i]){
index2=i;
break;
}
else{
if(r1<v[i+1]){
index2=i;
break;}
}
}
// index1 && index2 is found ! now apply brain mc
if(index2-index1==1)
result="NO";
else{
if((index2-index1)%2==0)
result="YES";
else
result="NO";
}
// cout<<index1<<" "<<index2<<endl;
cout<<result<<endl;
}
}