Codeforces Round #416 (Div. 2) B. Vladik and Complicated Book

#include <iostream>#include <algorithm>using namespace std;const int MAXN = 1e4+10;int num[MAXN];int main(){    cin.sync_with_stdio(false);    cin.tie(false);    int n,m;    cin >> n >> m;    for(int i = 1; i <= n; ++i)        cin >> num[i];    int l,r,x;    while(m--)    {        int cnt = 0;        cin >> l >> r >> x;        for(int i = l; i <= r; ++i)        {            if(num[i] < num[x])                ++cnt;        }        if(cnt+l == x)            cout << "Yes" << endl;        else            cout << "No" << endl;    }    return 0;}